Title :
Asymptotic Optimal Lossless Compression via the CSE Technique
Author :
Yokoo, Hidetoshi
Author_Institution :
Dept. of Comput. Sci., Gunma Univ., Kiryu, Japan
Abstract :
A novel loss less compression algorithm known as compression by sub string enumeration (CSE) is analyzed and modified. The CSE compression algorithm is a block-based, off-line method, as is the case with enumerative codes and the block-sorting compression scheme. First, we propose an encoding model that achieves asymptotic optimality for stationary ergodic sources. The codeword length attained by the proposed model converges almost surely to the entropy rate of a source when the length of a string generated by the source tends to infinity. Then, we propose a novel decoding algorithm that requires fewer code words than the original CSE.
Keywords :
decoding; sorting; source coding; string matching; CSE compression algorithm; asymptotic optimal lossless compression; block-based offline method; block-sorting compression scheme; codeword length; compression by substring enumeration; decoding algorithm; encoding model; enumerative codes; source entropy rate; stationary ergodic source; Arrays; Compression algorithms; Computational modeling; Decoding; Encoding; Entropy; Predictive models; Asymptotic optimality; BWT; CSE; data compression; lossless; universal codes;
Conference_Titel :
Data Compression, Communications and Processing (CCP), 2011 First International Conference on
Conference_Location :
Palinuro
Print_ISBN :
978-1-4577-1458-0
Electronic_ISBN :
978-0-7695-4528-8
DOI :
10.1109/CCP.2011.32