Zero error capacity under list decoding
Peter Eliaš · IEEE Transactions on Information Theory · 1988
Shannon's zero-error channel capacities C/sub OF/, C/sub O/ 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 C/sub OF/(L), C/sub O/(L) are nondecreasing in L. For an I-letter input alphabet, C/sub OF/(L) attains its maximum at L=I-1. A lower bound to C/sub O/(L) approaches that maximum as L increases.>
Cited by 61 works. doi:10.1109/18.21233
Authors
References
- A Mathematical Theory of Communication
- Information Theory and Reliable Communication
- The Theory of Error-Correcting Codes
- Personal communication
- Information Theory: Coding Theorems for Discrete Memoryless Systems
- The zero error capacity of a noisy channel
- Principles of digital communication and coding
- Lower bounds to error probability for coding on discrete memoryless channels. I
- Lower bounds to error probability for coding on discrete memoryless channels. II
- On the Shannon capacity of a graph