On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code
From MaRDI portal
Publication:2364475
DOI10.1134/S0032946016030078zbMath1369.94598OpenAlexW2534813806MaRDI QIDQ2364475
Publication date: 21 July 2017
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946016030078
Related Items (3)
A note on regular subgroups of the automorphism group of the linear Hadamard code ⋮ Propelinear codes related to some classes of optimal codes ⋮ On the generalized concatenated construction for the Nordstrom-Robinson code and the binary Golay code
Uses Software
Cites Work
- On weak isometries of preparata codes
- Nordstrom-Robinson code and \(A_7\)-geometry
- Structural properties of binary propelinear codes
- On the number of nonequivalent propelinear extended perfect codes
- To the metrical rigidity of binary codes
- On the minimum distance graph of an extended Preparata code
- On Z/sub 4/-linear preparata-like and kerdock-like codes
- On the Preparata and Goethals codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Translation-invariant propelinear codes
- Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs
- An optimum nonlinear code
- A class of optimum nonlinear double-error-correcting codes
- Coding theory and the Mathieu groups
- On automorphism groups of perfect binary codes and Steiner triple systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code
