Grammar-based lossless universal refinement source coding

IEEE Transactions on Information Theory

Volumn 50, Issue 7, 2004, Pages 1415-1424

  Kieffer, John C ^a   Yang, En Hui ^b  

^a University of Minnesota   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Conditional grammar entropy; Context free grammars; Refinement source coding

Indexed keywords

BINARY CODES; DATA COMPRESSION; DECODING; ENCODING (SYMBOLS);

CONDITIONAL GRAMMAR ENTROPY; REFINEMENT SOURCE CODING;

CONTEXT FREE GRAMMARS;

EID: 3042520756     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.830758     Document Type: Article

References (17)

1. T. M. Cover, "Enumerative source encoding," IEEE Trans. Inform. Theory, vol. IT-19, pp. 73-77, 1973.
2. W. H. Equitz and T. M. Cover, "Successive refinement of information," IEEE Trans. Inform. Theory, vol. 37, pp. 269-275, 1991.
3. J. C. Kieffer, "A tutorial on hierarchical lossless data compression," in Modeling Uncertainty, ser. Internat. Ser. Oper. Res. Management Sci. Boston, MA: Kluwer, 2002, vol. 46, pp. 711-733.
4. J. C. Kieffer and E.-H. Yang, "Ergodic behavior of graph entropy," Electron. Res. Announc. Amer. Math. Soc., vol. 3, pp. 11-16, 1997.
5. ____, "Grammar-based codes: A new class of universal lossless source codes," IEEE Trans. Inform. Theory, vol. 46, pp. 737-754, May 2000.
6. ____, "Structured grammar-based codes for universal lossless data compression," Commun. Inform. and Syst., vol. 2, pp. 29-52, 2002.
7. J. C. Kieffer, E.-h. Yang, G. J. Nelson, and P. Cosman, "Universal lossless compression via multilevel pattern matching," IEEE Trans. Inform. Theory, vol. 46, pp. 1227-1245, July 2000.
8. V. N. Koshelev, "Hierarchical coding of discrete sources," Probl. Pered. Inform., vol. 16, pp. 31-49, 1980.
9. L. Lastras and T. Berger, "All sources are nearly successively refinable," IEEE Trans. Inform. Theory, vol. 47, pp. 918-926, Mar. 2001.
10. E. Lehman and A. Shelat, "Approximation algorithms for grammar-based compression," in Proc. 11th ACM-SIAM Symp. Discrete Algorithms (SODA 2002), San Francisco, CA, Jan. 2002.
11. C. Nevill-Manning and I. Witten, "Identifying hierarchical structure in sequences: A linear-time algorithm," J. Artificial Intell. Res., vol. 7, pp. 67-82, 1997.
12. ____, "Compression and explanation using hierarchical grammars," Comput. J., vol. 40, pp. 103-116, 1997.
13. B. Rimoldi, "Successive refinement of information: Characterization of the achievable rates," IEEE Trans. Inform. Theory, vol. 40, pp. 253-259, Jan. 1994.
14. P. Subrahmanya and T. Berger, "A sliding window Lempel-Ziv algorithm for differential layer encoding in progressive transmission," in Proc. 1995 IEEE Int. Symp. Information Theory, Whistler, BC, Canada, p. 266.
15. E.-h. Yang and J. C. Kieffer, "Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models," IEEE Trans. Inform. Theory, vol. 46, pp. 755-777, May 2000.
16. E.-h. Yang, A. Kaltchenko, and J. C. Kieffer, "Universal lossless data compression with side information by using a conditional MPM grammar transform," IEEE Trans. Inform. Theory, vol. 47, pp. 2130-2150, Sept. 2001.
17. E.-h. Yang and D.-K. He, "Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. 2. With context models," IEEE Trans. Inform. Theory, vol. 49, pp. 2874-2894, Nov. 2003.