Bounds on the expected cost of one-to-one codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 92-

  Savari, Serap A ^a   Naheta, Akshay ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSION PROBLEMS; DISCRETE RANDOM VARIABLES; MEMORYLESS COST CHANNELS; SHANNON ORIGINAL BOUND;

ALGORITHMS; CONSTRAINT THEORY; COSTS; DECODING; ENCODING (SYMBOLS); ENTROPY; INTEGER PROGRAMMING; NUMBER THEORY; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

CODES (SYMBOLS);

EID: 5044241628     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. C. E. Shannon and W. Weaver, The Mathematical Theory of Communication, University of minois Press, Urbana, 1949.
2. S. A. Savari, "Some notes on Varn coding," I.E.E.E. Transactions on Information Theory, Vol. 40, No. 1, pp. 181-186, 1994.
3. A. D. Wyner, "An upper bound on the entropy series," Inform. Control 20, 176-181, 1972.
4. R. M. Krause, "Channels which transmit letters of unequal duration," Inform. Control 5, 13-24, 1962.
5. S. K. Leung-Yan-Cheong and T. M. Cover, "Some equivalences between Shannon entropy and Kolmogorov complexity," I.E.E.E. Trans. Inform. Theory IT-24, 331-338, 1978.