An exponential number of generalized Kerdock codes
From MaRDI portal
Publication:3315437
DOI10.1016/S0019-9958(82)91139-1zbMATH Open0532.94012OpenAlexW2001055111MaRDI QIDQ3315437FDOQ3315437
Authors: William M. Kantor
Publication date: 1982
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(82)91139-1
Recommendations
Cited In (15)
- Projective planes of order \(q\) whose collineation groups have order \(q^ 2\)
- The Automorphism Groups of the Kerdock Codes
- Flag transitive planes of order \(q^ n\) with a long cycle \(l_ \infty\) as a collineation
- Enumeration of Kerdock codes of length 64
- Classifications of finite highly transitive dimensional linear spaces
- On components of the Kerdock codes and the dual of the BCH code \(C_{1, 3}\)
- Finite linear spaces with flag-transitive groups
- Nearly flag-transitive affine planes
- Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
- Kerdock codes and related planes
- Orthogonal dual hyperovals, symplectic spreads, and orthogonal spreads
- A linear construction for certain Kerdock and Preparata codes
- Symplectic semifield planes and ℤ₄–linear codes
- Quaternionic line-sets and quaternionic Kerdock codes
- Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
This page was built for publication: An exponential number of generalized Kerdock codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315437)