Partial permutation decoding for binary linear Hadamard codes

DOI10.1016/j.endm.2014.08.006zbMath1338.94105arXiv1512.01839MaRDI QIDQ283663

Roland D. Barrolleta, Mercè Villanueva

Publication date: 13 May 2016

Full work available at URL: https://arxiv.org/abs/1512.01839

zbMATH Keywords

automorphism groups; Hadamard codes; permutation decoding

Mathematics Subject Classification ID

05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)

20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures

94B25: Combinatorial codes

94B35: Decoding

Related Items

Improved partial permutation decoding for Reed-Muller codes, Comparing decoding methods for quaternary linear codes, Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes

Cites Work

• Unnamed Item
• Partial permutation decoding for simplex codes
• \(\mathbb Z_2\mathbb Z_4\)-linear codes: Generator matrices and duality
• Partial permutation decoding for the first-order Reed-Muller codes
• PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\)
• PD-sets for the codes related to some classical varieties
• A permutation decoding of the (24, 12, 8) Golay code (Corresp.)
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• Permutation Decoding of Systematic Codes