Partial permutation decoding for the first-order Reed-Muller codes (Q1025449)

\textit{J. D. Key}, \textit{T. P. McDonough} and \textit{V. C. Mavron} [Finite Fields Appl. 12, No. 2, 232--247 (2006; Zbl 1089.94044)] determined information sets for generalized Reed-Muller codes. In this paper, the author has used these information sets for the first-order Reed-Muller codes \({\mathcal R}(1,m)\) and has shown that permutation decoding can be applied to these codes for j\(m> 4\) by finding \(s\)-PD-sets for \(2\leq s\leq 4\). The author has raised a problem in the conclusion section of the paper.