List decoding of q-ary Reed-Muller codes

IEEE Transactions on Information Theory

Volumn 50, Issue 4, 2004, Pages 679-682

  Pellikaan, Ruud ^a   Wu, Xin Wen ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

Guruswami Sudan algorithm; List decoding; Order domain; Q ary reed muller (RM) codes; Subfield subcodes

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; ERROR CORRECTION; MATRIX ALGEBRA; POLYNOMIALS; RANDOM PROCESSES; SIGNAL ENCODING; VECTORS;

GURUSWAMI-SUDAN ALGORITHM; LIST DECODING; ORDER DOMAIN; REED-MULLER CODES; REED-SOLOMON CODES; SUBFIELD CODES;

DECODING;

EID: 1942454247     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.825043     Document Type: Letter

References (18)

1. S. Arora and M. Sudan, "Improved low-degree testing and its applications," in Proc. 29th Annu. ACM Symp. Theory of Computing, 1997, pp. 485-495.
2. P. Elias, "List Decoding for Noisy Channel," Res. Lab. Electron., MIT, Cambridge, MA, Tech. Rep. 335, 1957.
3. O. Geil and T. Høholdt, "Footprints or generalized Bezout's theorem," IEEE Trans. Inform. Theory, vol. 46, pp. 635-641, Mar. 2000.
4. O. Geil and R. Pellikaan, "On the structure of order domains," Finite Fields Their Applic., vol. 8, pp. 369-396, 2002.
5. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic-geometry codes," IEEE Trans. Inform. Theory, vol. 45, pp. 1757-1767, Nov. 1999.
6. T. Kasami, S. Lin, and W. Peterson, "New generalization of Reed-Muller codes, Part I: Primitive codes," IEEE Trans. Inform. Theory, vol. IT-14, pp. 189-199, Mar. 1968.
7. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, ser. Math. Library, Elsevier Sci. Publ. New York: North-Holland, 1972, vol. 16.
8. J. Rifa and J. Borrell, "A fast algorithm to compute irreducible and primitive polynomials in finite fields," Math. Syst. Theory, vol. 28, pp. 13-20, 1995.
9. R. Roth and G. Ruckenstein, "Efficient decoding of Reed-Solomon codes beyond half the minimum distance," IEE Trans. Inform. Theory, vol. 46, pp. 246-257, Jan. 2000.
10. M. Shokrollahi and H. Wasserman, "List decoding of algebraic-geometric codes," IEEE Trans. Inform. Theory, vol. 45, pp. 432-437, Mar. 1999.
11. V. Shoup, "Fast construction of irreducible polynomials over finite fields," J. Symb. Comp., vol. 17, pp. 371-391, 1994.
12. I. E. Shparlinski, "Finding irreducible and primitive polynomials," Appl. Alg. Engin. Commun. Comp., vol. 4, pp. 263-268, 1993.
13. ____, Finite Fields: Theory and Computation, ser. Mathematics and its Applications. Dordrecht, The Netherlands: Kluwer, 1999, vol. 477.
14. M. Sudan, "Decoding of Reed-Solomon codes beyond the error-correction bound," J. Complexity, vol. 13, pp. 180-193, 1997.
15. M. Sudan, L. Trevisan, and S. Vadhan, "Pseudorandom generators without the XOR lemma," in Proc. 31st Annu. ACM Symp. Theory of Computing, 1999, pp. 537-546.
16. J. M. Wozencraft, "List decoding," in Quarterly Progress Report. Cambridge, MA: Res. Lab. Electronics, MIT, 1958, vol. 48, pp. 90-95.
17. X.-W. Wu, "An algorithm for finding the roots of the polynomials over order domains," in Proc. IEEE Int. Symp. Informaion Theory, Lausanne, Switzerland, June/July 2002, p. 202.
18. X.-W. Wu and P. H. Siegel, "Efficient root-finding algorithm with applications to list decoding of algebraic-geometric codes," IEEE Trans. Inform. Theory, vol. 47, pp. 2579-2587, Sept. 2001.