A new recursive universal code of the positive integers

IEEE Transactions on Information Theory

Volumn 46, Issue 2, 2000, Pages 717-723

  Yamamoto, Hirosuke ^a,b  

^a IEEE   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

Elias code; Log star function; Universal code of positive integers; Universal coding

Indexed keywords

CODES (SYMBOLS); MATHEMATICAL MODELS;

POSITIVE INTEGERS; RECURSIVE UNIVERSAL CODE;

SIGNAL ENCODING;

EID: 0033872013     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.825850     Document Type: Article

References (10)

1. T. Amemiya and H. Yamamoto, "A new class of the universal representation for the positive integers," IEICE Trans. Fundamentals, vol. E76-A, no. 3, pp. 447-452, Mar. 1993.
2. V. I. Levenshtein, "On the redundancy and delay of decodable coding of natural numbers," Probl. Cybern., vol. 20, pp. 149-155, 1968.
3. R. Ahlswede, T. S. Han, and K. Kobayashi, "Universal coding of integers and unbounded search trees," IEEE Trans. Inform. Theory, vol. 43, pp. 669-682, Mar. 1997.
4. P. Elias, "Universal codeword sets and representation of the integers," IEEE Trans. Inform. Theory, vol. IT-21, pp. 194-203, 1975.
5. J. L. Bentley and A. C. Yao, "An almost optimal algorithm for unbounded searching," Inform. Processing Lett., vol. 5, no. 3, pp. 82-87, 1976.
6. S. Even and M. Rodeh, "Economical encoding of comma between strings," Commun. ACM, vol. 21, no. 4, pp. 315-317, 1978.
7. Q. F. Stout, "Improved prefix encodings of the natural numbers," IEEE Trans. Inform. Theory, vol. IT-26, pp. 607-699, 1980.
8. T. C. Bell, J. G. Cleary, and I. H. Witten, Text Compression. Englewood Cliffs, NJ: Prentice-Hall, 1990.
9. V. I. Levenshtein, private communication, 1998.
10. H. Nakamura and S. Murashima, "Construction method of positive integer code by coding MSB string of length information of existing codes" (in Japanese), Trans. Inform. Processing Soc. of Japan, vol. 40, no. 4, pp. 1745-1753, Apr. 1999.