The sextuply shortened binary Golay code is optimal
From MaRDI portal
Publication:1727350
DOI10.1007/s10623-018-0532-zzbMath1421.94114OpenAlexW2885777845MaRDI QIDQ1727350
Publication date: 20 February 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://aaltodoc.aalto.fi/handle/123456789/33872
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- On optimal binary codes with unbalanced coordinates
- Classification algorithms for codes and designs
- Unrestricted codes with the Golay parameters are unique
- A fast algorithm for the maximum clique problem
- Practical graph isomorphism. II.
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Bounds for binary codes of length less than 25
- Isomorph-Free Exhaustive Generation
- A table of upper bounds for binary codes
- Error Detecting and Error Correcting Codes
- The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification
- Semidefinite Code Bounds Based on Quadruple Distances
- On Optimal Binary One-Error-Correcting Codes of Lengths $2^{m}-4$ and $2^{m}-3$
- On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16
- Improved Semidefinite Programming Bound on Sizes of Codes
- On upper bounds for unrestricted binary-error-correcting codes
This page was built for publication: The sextuply shortened binary Golay code is optimal
