Upper Bound on List-Decoding Radius of Binary Codes

Consider the problem of packing Hamming balls of a given relative radius subject to the constraint that they cover any point of the ambient Hamming space with multiplicity at most L. For odd L ≥ 3, an asymptotic upper bound on the rate of any such packing is proved. The resulting bound improves the best known bound (due to Blinovsky'1986) for rates below a certain threshold. The method is a superposition of the linear-programming idea of Ashikhmin, Barg, and Litsyn (that was previously used to improve the estimates of Blinovsky for L = 2) and a Ramsey-theoretic technique of Blinovsky. As an application, it is shown that for all odd L, the slope of the rate radius tradeoff is zero at zero rate.

[1]  Arya Mazumdar,et al.  The adversarial joint source-channel problem , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[2]  Alex Samorodnitsky,et al.  On the Optimum of Delsarte's Linear Program , 2001, J. Comb. Theory, Ser. A.

[3]  Plamen Simeonov,et al.  Strong asymptotics for Krawtchouk polynomials , 1998 .

[4]  Andrew J. Young,et al.  Converse and duality results for combinatorial source-channel coding in binary Hamming spaces , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[5]  Simon Litsyn,et al.  New Upper Bounds on Error Exponents , 1999, IEEE Trans. Inf. Theory.

[6]  Simon Litsyn,et al.  A New Upper Bound on Codes Decodable into Size-2 Lists , 1999 .

[7]  Nathan Linial,et al.  On the distance distribution of codes , 1995, IEEE Trans. Inf. Theory.

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

[9]  A. Barg,et al.  Distance distribution of binary codes and the error probability of decoding , 2004, IEEE Transactions on Information Theory.

[10]  Vladimir M. Blinovsky,et al.  Code bounds for multiple packings over a nonbinary finite alphabet , 2005, Probl. Inf. Transm..

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

[12]  Robert J. McEliece,et al.  New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.

[13]  Venkatesan Guruswami,et al.  A Lower Bound on List Size for List Decoding , 2005, IEEE Trans. Inf. Theory.

[14]  Yury Polyanskiy.  Upper Bound on List-Decoding Radius of Binary Codes , 2016, IEEE Trans. Inf. Theory.