Enumeration of Kerdock codes of length 64
From MaRDI portal
Publication:887418
DOI10.1007/S10623-015-0053-YzbMath1336.94092OpenAlexW2080624733MaRDI QIDQ887418
Publication date: 26 October 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0053-y
Cites Work
- Unnamed Item
- Unnamed Item
- On ``bent functions
- Piecewise constructions of bent and almost optimal Boolean functions
- A class of low-rate nonlinear binary codes
- An exponential number of generalized Kerdock codes
- On Z/sub 4/-linear preparata-like and kerdock-like codes
- ZRM Codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
- Symplectic semifield planes and ℤ₄–linear codes
- A class of optimum nonlinear double-error-correcting codes
This page was built for publication: Enumeration of Kerdock codes of length 64