Error-correcting codes for list decoding
Peter Eliaš · IEEE Transactions on Information Theory · 1991
In the list-of-L decoding of a block code the receiver of a noisy sequence lists L possible transmitted messages, and is in error only if the correct message is not on the list. Consideration is given to (n,e,L) codes, which correct all sets of e or fewer errors in a block of n bits under list-of-L decoding. New geometric relations between the number of errors corrected under list-of-1 decoding and the (larger) number corrected under list-of-L decoding of the same code lead to new lower bounds on the maximum rate of (n,e,L) codes. They show that a jammer who can change a fixed fraction p>
Cited by 180 works. doi:10.1109/18.61123
Authors
References
- Information Theory and Reliable Communication.
- The Theory of Error-Correcting Codes
- Personal communication
- Algebraic Coding Theory
- Information Theory: Coding Theorems for Discrete Memoryless Systems
- Principles of digital communication and coding
- Information Theory and Reliable Communication
- Lower bounds to error probability for coding on discrete memoryless channels. I
- Lower bounds to error probability for coding on discrete memoryless channels. II
- Algebraic Coding Theory