Presentation 2004/3/8
Improved Sequential MPM Coding with O(1/logn) Maximal Redundancy
Kuninori ISHII, Hirosuke YAMAMOTO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The sequential Multilevel Pattern Matching(MPM) code can attain O(1/logn) maximal redundancy. We have already proposed a coding algorithm which has better practical compression performance with O(1/logn) maximal redundancy. In this paper, we propose a new improved sequential MPM coding algorithm. The coding complexities of all sequential MPM algorithms are also evaluated. Furthermore, it is showed by compressing a corpus that the improved MPM codes are more efficient than the original MPM code and the previous sequential MPM codes.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) MPM code / sequential MPM code / Grammar-based coding / Universal lossless data compression
Paper # IT2003-59,ISEC2003-99,WBS2003-177
Date of Issue

Conference Information
Committee ISEC
Conference Date 2004/3/8(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 Security (ISEC)
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/logn) 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 2004/3/8
Paper # IT2003-59,ISEC2003-99,WBS2003-177
Volume (vol) vol.103
Number (no) 712
Page pp.pp.-
#Pages 6
Date of Issue