On error correction with feedback under list decoding

Authors:
Ofer Shayevitz
Affiliations:
Information Theory and Applications Center, University of California, San Diego, La Jolla, CA
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 6
Cited 0

Solution of Ulam's problem on searching with a lie

Journal of Combinatorial Theory Series A
Ulam's searching game with a fixed number of lies

Theoretical Computer Science
Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes

Discrete Mathematics
List decoding of error-correcting codes

List decoding of error-correcting codes
Precise coding with noiseless feedback

Precise coding with noiseless feedback
Entropy, Search, Complexity (Bolyai Society Mathematical Studies)

Entropy, Search, Complexity (Bolyai Society Mathematical Studies)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work provides some preliminary results on the problem of error correction in the presence of noiseless feedback, where list-of-L decoding is allowed. The methods introduced by Berlekamp for the list-of-1 setting are generalized, and some basic finite-block constraints are described. These constraints are then combined to derive an upper bound on the asymptotically achievable rates for a large family of strategies, as a function of the maximal error fraction p and the list size L.