A root-finding algorithm for list decoding of Reed-Muller codes
MetadataShow full item record
Let Fq[X1,...,Xm] denote the set of polynomials over Fq in m variables, and Fq[X1,...,Xm]=u denote the subset that consists of the polynomials of total degree at most u. Let H(T) be a nontrivial polynomial in T with coefficients in Fq[X1,...,Xm]. A crucial step in interpolation-based list decoding of q-ary Reed-Muller (RM) codes is finding the roots of H(T) in Fq[X1,...,Xm]=u. In this correspondence, we present an efficient root-finding algorithm, which finds all the roots of H(T) in Fq[X1,...,Xm]=u. The algorithm can be used to speed up the list decoding of RM codes.
IEEE Transactions on Information Theory
© 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Coding and Information Theory