Presentation 2003/7/15
Improved Sequential MPM Coding with O(1/log n) Maximal Redundancy
Kuninori ISHII, Hirosuke YAMAMOTO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The MPM code can attain O(1/log n) maximal redundancy, but its coding is off-line. On the other hand, Takekawa-Yamamoto proposed a sequential MPM coding algorithm, and showed that it can attain the maximal redundancy O(1/log n). Moreover, they also proposed a modified sequential MPM coding algorithm to improve the compression rate of practical files. However, the modified coding algorithm is not quaranteed to attain the maximal redundancy O(1/ log n). In this paper, a new improved sequential MPM coding algorithm is proposed. Furthermore, it is proved theoretically that the proposed coding algorithm can attain the maximal redundancy O(1 / log n), and it is showed that it is more efficient than the original MPM code and sequential MPM code by compressing a corpus.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) MPM code / sequential MPM code / Grammar-based coding / Universal lossless data compression
Paper # IT2003-15(2003-07)
Date of Issue

Conference Information
Committee IT
Conference Date 2003/7/15(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Improved Sequential MPM Coding with O(1/log n) Maximal Redundancy
Sub Title (in English)
Keyword(1) MPM code
Keyword(2) sequential MPM code
Keyword(3) Grammar-based coding
Keyword(4) Universal lossless data compression
1st Author's Name Kuninori ISHII
1st Author's Affiliation Department of Mathematical Informatics, University of Tokyo()
2nd Author's Name Hirosuke YAMAMOTO
2nd Author's Affiliation Department of Mathematical Informatics, University of Tokyo
Date 2003/7/15
Paper # IT2003-15(2003-07)
Volume (vol) vol.103
Number (no) 214
Page pp.pp.-
#Pages 6
Date of Issue