Construction of binary Hadamard codes and their \(s\)-PD sets
From MaRDI portal
Publication:2119850
DOI10.1007/s12095-021-00471-5zbMath1495.94103OpenAlexW3134411742MaRDI QIDQ2119850
Briji J. Chathely, R. P. Deore
Publication date: 30 March 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00471-5
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items
Uses Software
Cites Work
- Permutation decoding of \(\mathbb Z_2{\mathbb Z}_4\)-linear codes
- Type II codes over \(\mathbb F_4\)
- (1 + u) constacyclic and cyclic codes over \(F_{2} + uF_{2}\)
- Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes
- Information-Set Decoding for Linear Codes over F q
- Codes over integer residue rings
- Lee metric codes over integer residue rings (Corresp.)
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Efficient decoding of Z/sub p/k-linear codes
- Type IV self-dual codes over rings
- Decoding of linear codes over Galois rings
- Type II codes over F/sub 2/+uF/sub 2/
- Smaller Decoding Exponents: Ball-Collision Decoding
- Codes over certain rings
- Permutation Decoding of Systematic Codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item