Improved partial permutation decoding for Reed-Muller codes

DOI10.1016/J.DISC.2016.11.031MaRDI QIDQ507498zbMATH OpenOpenAlexFDO

Authors J. D. Key, T. P. McDonough, V. C. Mavron

Publication date 6 February 2017

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2016.11.031

zbMATH Keywords

permutation decodingReed-Muller codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Partial permutation decoding for the first-order Reed-Muller codes
• New advances in permutation decoding of first-order Reed-Muller codes
• Reed-Muller codes and permutation decoding
• Partial permutation decoding for simplex codes
• Partial permutation decoding for binary linear Hadamard codes
• Partial permutation decoding for MacDonald codes
• Partial Permutation Decoding for Abelian Codes
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Partial permutation decoding for codes from finite planes
• scientific article; zbMATH DE number 2170433

Cites work

• Decompositions and extremal type II codes over Z/sub 4/
• Greedy codes
• 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 1284429 (Why is no real title available?)
• scientific article; zbMATH DE number 3999824 (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 binary linear Hadamard codes
• Partial permutation decoding for codes from finite planes
• Partial permutation decoding for simplex codes
• PD-sets for the codes related to some classical varieties
• Permutation Decoding of Systematic Codes
• Reed-Muller codes and permutation decoding
• The Magma algebra system. I: The user language

Cited in

(15)

• Partial permutation decoding for the first-order Reed-Muller codes
• Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\)
• Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs
• Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes
• Partial permutation decoding for codes from affine geometry designs
• Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even
• New advances in permutation decoding of first-order Reed-Muller codes
• Partial permutation decoding for simplex codes
• Partial permutation decoding for MacDonald codes
• Special \textit{LCD} codes from products of graphs
• Distance-regular graphs and new block designs obtained from the Mathieu groups
• Some algebraic questions about the Reed-Muller code
• Designer of codes: a tribute to Jennifer Key
• Reed-Muller codes and permutation decoding
• Minimum-size s-PD sets in partial permutation decoding with applications to cyclic and quasi-cyclic codes

Describes a project that uses

Uses Software

• GAP
• Magma

This page was built for publication: Improved partial permutation decoding for Reed-Muller codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507498)