A Bound on the zero-error list coding capacity
View/
Date
1993Journal Title
Proceedings of the 1993 IEEE International Symposium on Information Theory
Publisher
Publ by IEEE, Piscataway, NJ, United States
Pages
152
Language
English
Type
Conference Paper
Metadata
Show full item recordPlease cite this item using this persistent URL
http://hdl.handle.net/11693/27804Abstract
We present a new bound on the zero-error list coding capacity, and using which, show that the list-of-3 capacity of the 4/3 channel is at most 6/19 bits, improving the best previously known bound of 3/8. The relation of the bound to the graph-entropy bound of Koerner and Marton is also discussed.