Asymptotic Optimal Lossless Compression via the CSE Technique

@article{Yokoo2011AsymptoticOL,
  title={Asymptotic Optimal Lossless Compression via the CSE Technique},
  author={Hidetoshi Yokoo},
  journal={2011 First International Conference on Data Compression, Communications and Processing},
  year={2011},
  pages={11-18}
}
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… CONTINUE READING
8 Extracted Citations
11 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-8 of 8 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 11 references

An efficient algorithm for generating necklaces with fixed density

  • F. Ruskey, J. Sawada
  • SIAM J. Comput., vol. 29, no. 2, pp. 671–684
  • 1999
Highly Influential
4 Excerpts

An improvement of lossless data compression via substring enumeration (in Japanese)

  • Y. Shima, K. Iwata, M. Arimura
  • IEICE Technical Report, IT2011-1, pp. 1–6
  • 2011
1 Excerpt

Similar Papers

Loading similar papers…