| Grammar-based Codes |
Website Links For Codes |
Information AboutGrammar-based Codes |
|
EXAMPLES The class of grammar-based codes is very broad. It includes block codes, variations of the incremental parsing Lempel-Ziv code Ziv and Lempel 1978 ( LZ78 ), the multilevel pattern matching (MPM) algorithm Kieffer et. al. 2000, and many other new universal lossless compression algorithms. CODING THEOREMS Grammar-based codes are universal in the sense that they can achieve asymptotically the entropy rate of any stationary, ergodic source with a finite alphabet. REFERENCES Kieffer-Yang 2000. J. C. Kieffer and E.-H. Yang, "Grammar-based codes: A new class of universal lossless source codes," IEEE Trans. Inform. Theory, vol. 46, pp. 737--754, 2000. Ziv and Lempel 1978. J. Ziv and A. Lempel, "Compression of individual sequences via variable rate coding," IEEE Trans. Inform. Theory, vol. 24, pp. 530--536, 2000. Kieffer et. al. 2000. J. C. Kieffer, E.-H. Yang, G. Nelson, and P. Cosman, "Universal lossless compression via multilevel pattern matching," IEEE Trans. Inform. Theory, vol. 46, pp. 1227--1245, 2000. |
|
|