Zero error capacity under list decoding
- 1 September 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 34 (5) , 1070-1074
- https://doi.org/10.1109/18.21233
Abstract
Shannon's zero-error channel capacities COF, CO with and without noiseless feedback are generalized to list decoding: the receiver lists L messages, erring if the correct one is not listed. The corresponding capacities COF(L), CO(L) are nondecreasing in L. For an I-letter input alphabet, COF(L) attains its maximum at L=I-1. A lower bound to CO(L ) approaches that maximum as L increasesKeywords
This publication has 4 references indexed in Scilit:
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- Channel capacities for list codesJournal of Applied Probability, 1973
- Lower bounds to error probability for coding on discrete memoryless channels. IInformation and Control, 1967
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956