New bounds on the expected length of one-to-one codes

IEEE Transactions on Information Theory

Volumn 42, Issue 1, 1996, Pages 246-250

  Blundo, Carlo ^a   De Prisco, Roberto ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

Nonprefix codes; One to one codes; Source coding

Indexed keywords

ENCODING (SYMBOLS); INFORMATION THEORY; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

BINARY ENCODING; BINARY ENTROPY; CODEWORDS; DISCRETE RANDOM VARIABLES; LOWER BOUNDS; NONPREFIX CODES; ONE TO ONE CODES; PREFIX FREE CODES; SOURCE CODING; UPPER BOUNDS;

BINARY CODES;

EID: 0029732099     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.481795     Document Type: Article

References (5)

1. N. Alon and A. Orlitsky, "A lower bound on the expected length of one-to-one codes," IEEE Trans. Inform. Theory, vol. 40, no. 5, pp. 1670-1672, Sept. 1994.
2. S. K. Leung-Yan-Cheong and T. M. Cover, "Some equivalences between Shannon entropy and Kolmogorov complexity," IEEE Trans. Inform. Theory, vol. IT-24, no. 3, pp. 331-338, May 1978.
3. C. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-4123, 623-656, 1948
4. E. I. Verriest, "An achievable bound for optimal noiseless coding of a random variable," IEEE Trans. Inform. Theory, vol. IT-32, no. 4, pp. 592-594, July 1986.
5. A. D. Wyner, "An upper bound on the entropy series," Inform. Contr., vol. 20, pp. 176-181, 1972.