We give a recursive decoding algorithm for projective Reed-Muller codes making use of a decoder for affine Reed-Muller codes. We determine the number of errors that can be corrected in this way, which is the current highest for decoders of projective Reed-Muller codes. We show when we can decode up to the error correction capability of these codes, and we compute the order of complexity of the algorithm, which is given by that of the chosen decoder for affine Reed-Muller codes.

翻译：本文提出了一种射影Reed-Muller码的递归译码算法，该算法利用仿射Reed-Muller码的译码器实现。我们确定了通过该方法可纠正的错误数量，这是目前射影Reed-Muller码译码器所能达到的最高纠错能力。我们展示了在何种条件下能够达到这些码的纠错极限，并计算了算法的复杂度阶数，该复杂度由所选仿射Reed-Muller码译码器的复杂度决定。