Enumerative Source Encoding

IEEE Transactions on Information Theory

Volumn 19, Issue 1, 1973, Pages 73-77

  Cover, Thomas M ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY - DATA COMPRESSION;

CODES, SYMBOLIC;

EID: 0015565580     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1973.1054929     Document Type: Article

References (9)

1. D. H. Lehmer, “Teaching combinatorial tricks to a computer,” in Proc. Symp. Applied Mathematics, vol. 10: Combinatorial Analysis. Providence, R.I. : Amer. Math. Soc., 1960.
2. T. J. Lynch, “Sequence time coding for data compression,” Proc. IEEE (Lett.), vol. 54, pp. 1490–1491, Oct. 1966.
3. J. P. M. Schalkwijk, “An algorithm for source coding,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 395–399, May 1972.
4. L. D. Davisson, “Comments on ‘Sequence time coding for data compression’,” Proc. IEEE (Lett.), vol. 54, p. 2010, Dec. 1966.
5. P. Elias, “On binary representations of monotone sequences,” in Proc. 6th Princeton Conf. Systems Theory, Apr. 1972.
6. W. Feller, An Introduction to Probability Theory and Its Applications, vol. 1. New York: Wiley, 1957.
7. V. F. Babkin, “Method of universal coding for a source of independent messages with non-exponential complexity of calculations” (in Russian), Probl. Inform. Transmiss., vol. 7, No.4, 1971.
8. Yu. M. Shtarkov and V. F. Babkin, “Combinatorial method of universal coding for discrete stationary sources” (in Russian), Probl. Contr. Inform. Transmiss., to be published.
9. R. Ash, Information Theory. New York: Wiley, 1965.