Presentation 2003/7/15
Performance of compression with the LZ78 codes for word-valued source
Kouji YOSHIDA, Takashi ISHIDA, Shigeich HIRASAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The Ziv-Lempel(LZ)codes which are typical universal codes have been proposed modifing algorithms from not only theoretical but practical use. Recently, a word-valued source has been by proposed as a new class of source models, and its entropy rate is analyzed. The LZ78 codes for the word-valued source can be applied with two kinds of methods (i) inclemental parsing for each word (ii) inclemental parsing for each symbol. The performance compression of the LZ78 codes between these two kinds of methods is an interesting theme. In this paper, we show that the upper bound of average redundancy achieves O(1/log n) and consider about validity of LZ78 codes.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) source coding / word-valued source / redundancy / LZ codes
Paper # IT2003-14(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) Performance of compression with the LZ78 codes for word-valued source
Sub Title (in English)
Keyword(1) source coding
Keyword(2) word-valued source
Keyword(3) redundancy
Keyword(4) LZ codes
1st Author's Name Kouji YOSHIDA
1st Author's Affiliation School of Science and Engineering, Waseda University()
2nd Author's Name Takashi ISHIDA
2nd Author's Affiliation School of Science and Engineering, Waseda University
3rd Author's Name Shigeich HIRASAWA
3rd Author's Affiliation School of Science and Engineering, Waseda University
Date 2003/7/15
Paper # IT2003-14(2003-07)
Volume (vol) vol.103
Number (no) 214
Page pp.pp.-
#Pages 6
Date of Issue