Arıkan, Erdal2016-02-082016-02-081993http://hdl.handle.net/11693/27804Date of Conference: 17-22 January 1993Conference Name: International Symposium on Information Theory, IEEE 1993We 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.EnglishEntropyError correctionGraph theoryInformation theoryCoding capacityMemoryless systemsConference Paper10.1109/ISIT.1993.748467