The sextuply shortened binary Golay code is optimal
From MaRDI portal
Recommendations
- Uniqueness of some linear subcodes of the extended binary Golay code
- Bounds for binary codes of length less than 25
- On optimal binary codes with unbalanced coordinates
- Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes
- A new two-error-correcting binary code of length 16
Cites work
- A fast algorithm for the maximum clique problem
- A Mathematical Theory of Communication
- A table of upper bounds for binary codes
- Bounds for binary codes of length less than 25
- Classification algorithms for codes and designs
- Error detecting and error correcting codes
- scientific article; zbMATH DE number 3543912 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Improved Semidefinite Programming Bound on Sizes of Codes
- Isomorph-Free Exhaustive Generation
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- On optimal binary codes with unbalanced coordinates
- 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
- On upper bounds for unrestricted binary-error-correcting codes
- Practical graph isomorphism. II.
- Semidefinite Code Bounds Based on Quadruple Distances
- The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification
- Unrestricted codes with the Golay parameters are unique
Cited in
(3)
This page was built for publication: The sextuply shortened binary Golay code is optimal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1727350)
