An improved list decoding algorithm for the second order Reed–Muller codes and its applications

We propose an algorithm which is an improved version of the Kabatiansky–Tavernier list decoding algorithm for the second order Reed–Muller code RM(2, m), of length n = 2m, and we analyse its theoretical and practical complexity. This improvement allows a better theoretical complexity. Moreover, we conjecture another complexity which corresponds to the results of our simulations. This algorithm has the strong property of being deterministic and this fact drives us to consider some applications, like determining some lower bounds concerning the covering radius of the RM(2, m) code.

[1]  Ilya Dumer,et al.  List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity , 2006, 2006 IEEE International Symposium on Information Theory.

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

[3]  Claude Carlet.  The complexity of Boolean functions from cryptographic viewpoint , 2006, Complexity of Boolean Functions.

[4]  Gérard D. Cohen,et al.  Covering Codes , 2005, North-Holland mathematical library.

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

[6]  Ilya Dumer,et al.  Recursive decoding and its performance for low-rate Reed-Muller codes , 2004, IEEE Transactions on Information Theory.

[7]  Sihem Mesnager,et al.  Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes , 2007, IEEE Transactions on Information Theory.

[8]  Ronitt Rubinfeld,et al.  Learning Polynomials with Queries: The Highly Noisy Case , 2000, SIAM J. Discret. Math..

[9]  James R. Schatz.  The second order Reed-Muller code of length 64 has covering radius 18 , 1981, IEEE Trans. Inf. Theory.

[10]  N. J. A. Sloane,et al.  Weight enumerator for second-order Reed-Muller codes , 1970, IEEE Trans. Inf. Theory.

[11]  Xin-Wen Wu,et al.  List decoding of q-ary Reed-Muller codes , 2004, IEEE Transactions on Information Theory.

[12]  Xiang-dong Hou.  Some results on the covering radii of Reed-Muller codes , 1993, IEEE Trans. Inf. Theory.

[13]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[14]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.