Partial permutation decoding for the first-order Reed-Muller codes
From MaRDI portal
\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.
Recommendations
- Reed-Muller codes and permutation decoding
- Improved partial permutation decoding for Reed-Muller codes
- New advances in permutation decoding of first-order Reed-Muller codes
- Information sets and partial permutation decoding for codes from finite geometries
- Partial permutation decoding for codes from affine geometry designs
Cites work
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284430 (Why is no real title available?)
- Information sets and partial permutation decoding for codes from finite geometries
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- On coverings
- Partial permutation decoding for codes from finite planes
- Permutation Decoding of Systematic Codes
Cited in
(11)- Orphan structure of the first-order Reed--Muller codes
- Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes
- Information sets in abelian codes: defining sets and Groebner basis
- Partial permutation decoding for codes from affine geometry designs
- Information sets and partial permutation decoding for codes from finite geometries
- New advances in permutation decoding of first-order Reed-Muller codes
- Partial permutation decoding for binary linear Hadamard codes
- On a recursive algorithm of decoding some subsets of the first-order Reed-Muller codes
- Improved partial permutation decoding for Reed-Muller codes
- Reed-Muller codes and permutation decoding
- Minimum-size s-PD sets in partial permutation decoding with applications to cyclic and quasi-cyclic codes
This page was built for publication: Partial permutation decoding for the first-order Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025449)
