2011 · 17 citations · 7 references
EngineeringComputer ScienceAlgorithmsData StructuresInformation TheoryCoding TheoryData CompressionError-correcting CodesLossless Data CompressionLossy Data CompressionSource CodingBlock-based CompressionCompressionEntropy CodingEntropy RateEnumerative CodingLossless Source CodingLossy Source CodingOff-line Analysis
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.
7
A Block-sorting Lossless Data Compression Algorithm
Michael T. Burrows, D. J. Wheeler · 1994 · 2.4K citations
Thomas M. Cover · IEEE Transactions on Information Theory · 1973 · 508 citations
Lossless Data Compression via Substring Enumeration
Danny Dubé, Vincent Beaudoin · 2010 · 29 citations