A bound on the zero-error list coding capacity

Date
1993
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Proceedings of the International Symposium on Information Theory, IEEE 1993
Print ISSN
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
152
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
Series
Abstract

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.

Course
Other identifiers
Book Title
Keywords
Entropy, Error correction, Graph theory, Information theory, Coding capacity, Memoryless systems
Citation
Published Version (Please cite this version)