Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes
From MaRDI portal
Publication:2413011
DOI10.1007/s10623-017-0342-8zbMath1426.94156MaRDI QIDQ2413011
Roland D. Barrolleta, Mercè Villanueva
Publication date: 6 April 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-017-0342-8
Related Items
Construction of binary Hadamard codes and their \(s\)-PD sets, New advances in permutation decoding of first-order Reed-Muller codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Partial permutation decoding for binary linear Hadamard codes
- Partial permutation decoding for simplex codes
- Permutation decoding of \(\mathbb Z_2{\mathbb Z}_4\)-linear codes
- Improved partial permutation decoding for Reed-Muller codes
- Reed-Muller codes and permutation decoding
- \(\mathbb Z_2\mathbb Z_4\)-linear codes: Generator matrices and duality
- Partial permutation decoding for the first-order Reed-Muller codes
- On coverings
- Characterization of the automorphism group of quaternary linear Hadamard 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)\)
- Classification of the <inline-formula> <tex-math notation="LaTeX">$Z_{2}Z_{4}$ </tex-math></inline-formula>-Linear Hadamard Codes and Their Automorphism Groups
- On the additive (/spl Zopf//sub 4/-linear and non-/spl Zopf//sub 4/-linear) Hadamard codes: rank and kernel
- A permutation decoding of the (24, 12, 8) Golay code (Corresp.)
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Fundamentals of Error-Correcting Codes
- Permutation Decoding of Systematic Codes
