Generalized Tunstall codes for sources with memory

IEEE Transactions on Information Theory

Volumn 43, Issue 2, 1997, Pages 658-668

  Savari, Scrap A ^a   Gallager, Robert G ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b USA   (United States)

Author keywords

Sources with memory; Tunstall codes; Variable to fixed length codes

Indexed keywords

DATA COMPRESSION; DATA STORAGE EQUIPMENT; ENCODING (SYMBOLS); INFORMATION THEORY; MARKOV PROCESSES;

DICTIONARY SIZE; SOURCES WITH MEMORY; TUNSTALL CODES; VARIABLE TO FIXED LENGTH CODES;

CODES (SYMBOLS);

EID: 0031104387     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556121     Document Type: Article

References (15)

1. C. E. Shannon and W. Weaver, The Mathematical Theory of Communication. Urbana, IL: Univ. of Illinois Press, 1949.
2. P. Elias, "Predictive coding," IRE Trans. Inform. Theory, vol. IT-1, pp. 16-33, Mar. 1955.
3. B. P. Tunstall, "Synthesis of noiseless compression codes," Ph.D. dissertation, Georgia Inst. Technol., Atlanta, GA, 1967.
4. G. L. Khodak, "Delay-redundancy relation of VB-encoding," in All-Union Conf. on Theoretical Cybernetics (Novobirsk, USSR, 1969) (in Russian).
5. R. Krichevsky, Universal Compression and Retrieval. Dordrecht, The Netherlands: Kluwer, 1994.
6. T. J. Tjalkens and F. M. J. Willems, "Variable to fixed-length codes for Markov sources," IEEE Trans. Inform. Theory, vol. IT-33, pp. 246-257, 1987.
7. J. Ziv and A. Lempel, "A universal algorithm for data compression," IEEE Trans. Inform. Theory, vol. IT-23, pp. 337-343, 1977.
8. _, "Compression of individual sequences via variable-rate coding," IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, 1978.
9. F. Jelinek and G. Longo, "Algorithms for source coding," in Coding and Complexity, G. Longo, Ed. Wien, Austria: Springer-Verlag, 1975.
10. K. L. Chung, Markov Chains with Stationary Transition Probabilites. Berlin, Germany: Springer-Verlag, 1960.
11. S. M. Ross, Stochastic Processes. New York: Wiley, 1983.
12. R. G. Gallager, Discrete Stochastic Processes. Boston, MA: Kluwer, 1996.
13. S. A. Savari, "Variable-to-fixed length codes for sources with known and unknown memory," Ph.D. dissertation, Mass. Inst. Technol., Cambridge, MA, Feb. 1996.
14. P. Ney and E. Nummelin, "Markov additive processes. I. Eigenvalues properties and limit theorems," Ann. Prob., vol. 15, pp. 561-592, 1987.
15. W. Feller, An Introduction to Probability Theory and Its Applications, vol. 2. New York: Wiley, 1966 (2nd ed. 1971).