Bound on the zero error list coding capacity
Proceedings of the 1993 IEEE International Symposium on Information Theory
Publ by IEEE, Piscataway, NJ, United States
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27804
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.
- Conference Paper 2294