Partial permutation decoding for binary linear Hadamard codes
From MaRDI portal
Publication:283663
DOI10.1016/j.endm.2014.08.006zbMath1338.94105arXiv1512.01839OpenAlexW2124775998MaRDI QIDQ283663
Roland D. Barrolleta, Mercè Villanueva
Publication date: 13 May 2016
Full work available at URL: https://arxiv.org/abs/1512.01839
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Combinatorial codes (94B25) Decoding (94B35)
Related Items (3)
Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes ⋮ Improved partial permutation decoding for Reed-Muller codes ⋮ Comparing decoding methods for quaternary linear 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
This page was built for publication: Partial permutation decoding for binary linear Hadamard codes