Improved partial permutation decoding for Reed-Muller codes

DOI10.1016/j.disc.2016.11.031zbMath1393.94931OpenAlexW2566000337MaRDI QIDQ507498

T. P. McDonough, Jennifer D. Key, Vassili 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

Reed-Muller codespermutation decoding

Mathematics Subject Classification ID

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

Related Items

Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes, Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even, 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, Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs, Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\)

Uses Software

• GAP
• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial permutation decoding for binary linear Hadamard codes
• Partial permutation decoding for simplex codes
• Greedy codes
• Reed-Muller codes and permutation decoding
• The Magma algebra system. I: The user language
• Partial permutation decoding for codes from finite planes
• On coverings
• Information sets and partial permutation decoding for codes from finite geometries
• PD-sets for the codes related to some classical varieties
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• Decompositions and extremal type II codes over Z/sub 4/
• Permutation Decoding of Systematic Codes