Partial permutation decoding for the first-order Reed-Muller codes

DOI10.1016/j.disc.2008.03.027zbMath1171.94014OpenAlexW2054296318MaRDI QIDQ1025449

J. Martínez

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

first-order Reed-Muller codespermutation decodinggeneralized Reed-Muller codesPD-sets

Mathematics Subject Classification ID

Decoding (94B35)

Related Items

Partial permutation decoding for binary linear Hadamard codes, Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes, Information sets in abelian codes: defining sets and Groebner basis, New advances in permutation decoding of first-order Reed-Muller codes, Reed-Muller codes and permutation decoding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial permutation decoding for codes from finite planes
• On coverings
• Information sets and partial permutation decoding for codes from finite geometries
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• Permutation Decoding of Systematic Codes