Partial permutation decoding for the first-order Reed-Muller codes (Q1025449): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 22:07, 30 January 2024

scientific article
Language Label Description Also known as
English
Partial permutation decoding for the first-order Reed-Muller codes
scientific article

    Statements

    Partial permutation decoding for the first-order Reed-Muller codes (English)
    0 references
    0 references
    19 June 2009
    0 references
    \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.
    0 references
    first-order Reed-Muller codes
    0 references
    generalized Reed-Muller codes
    0 references
    PD-sets
    0 references
    permutation decoding
    0 references

    Identifiers