Unrestricted codes with the Golay parameters are unique
From MaRDI portal
Publication:1218393
DOI10.1016/0012-365X(75)90047-3zbMath0307.94013MaRDI QIDQ1218393
Philippe Delsarte, Jean-Marie Goethals
Publication date: 1975
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (10)
Quasi-symmetric designs and self-dual codes ⋮ PIR codes with short block length ⋮ Algebraic theory of block codes detecting independent errors ⋮ The sextuply shortened binary Golay code is optimal ⋮ More on the uniqueness of the Golay codes ⋮ The regular two-graph on 276 vertices ⋮ The hyperplanes of the near hexagon related to the extended ternary Golay code ⋮ Spherical codes and designs ⋮ The uniqueness of the near hexagon on 729 points ⋮ An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes
Cites Work
- A note on a result in the theory of code construction
- Error Detecting and Error Correcting Codes
- Four fundamental parameters of a code and their combinatorial significance
- On the uniqueness of the Golay codes
- On the Nonexistence of Perfect Codes over Finite Fields
- Coding theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Unrestricted codes with the Golay parameters are unique
