List decodability at small radii

A′(n, d, e), the smallest ℓ for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size ℓ up to radius e, is determined for all d ≥ 2e − 3. As a result, A′(n, d, e) is determined for all e ≤ 4, except for 42 values of n.

[1]  Vladimir M. Blinovsky,et al.  List decoding , 1992, Discret. Math..

[2]  Rangasami L. Kashyap,et al.  Estimation of probability density and distribution functions , 1968, IEEE Trans. Inf. Theory.

[3]  Elwyn R. Berlekamp,et al.  Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II , 1967, Inf. Control..

[4]  Peter Elias,et al.  List decoding for noisy channels , 1957 .

[5]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[6]  Peter Elias,et al.  Error-correcting codes for list decoding , 1991, IEEE Trans. Inf. Theory.

[7]  Rudolf Ahlswede,et al.  Channel capacities for list codes , 1973, Journal of Applied Probability.

[8]  V. Blinovsky,et al.  Asymptotic Combinatorial Coding Theory , 1997 .

[9]  Andries E. Brouwer,et al.  Optimal Packings of K4's into a Kn , 1979, J. Comb. Theory A.

[10]  Johan Sebastian Rosenkilde Nielsen.  List decoding of Error-Correcting Codes , 2010 .

[11]  A. E. Brouwer,et al.  Optimal packings of $K_4$'s into a K$_n$ : the case n $\equiv$ 5 (mod 6) , 1976 .

[12]  Jehoshua Bruck,et al.  A Combinatorial Bound on the List Size , 2004 .

[13]  Selmer M. Johnson,et al.  Upper bounds for constant weight error correcting codes , 1972, Discret. Math..

[14]  Andries E. Brouwer,et al.  On the packing of quadruples without common triples : (preprint) , 1977 .

[15]  Venkatesan Guruswami,et al.  List Decoding of Error-Correcting Codes (Winning Thesis of the 2002 ACM Doctoral Dissertation Competition) , 2005, Lecture Notes in Computer Science.

[16]  N. J. A. Sloane,et al.  A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.

[17]  Venkatesan Guruswami,et al.  Extensions to the Johnson bound , 2001 .

[18]  Haim Hanani,et al.  On Quadruple Systems , 1960, Canadian Journal of Mathematics.

[19]  N. Sloane,et al.  Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. I , 1993 .

[20]  L. Ji.  Asymptotic Determination of the Last Packing Number of Quadruples , 2006, Des. Codes Cryptogr..

[21]  G. David Forney,et al.  Exponential error bounds for erasure, list, and decision feedback schemes , 1968, IEEE Trans. Inf. Theory.

[22]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[23]  Joel Spencer,et al.  Maximal consistent families of triples , 1968 .