A simple proof of the improved Johnson bound for binary codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3167429 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- A new binary code of length 16 and minimum distance 3
- A new four-error-correcting code of length 20
- A table of upper bounds for binary codes
- Binary codes with a minimum distance of four (Corresp.)
- Codes from affine permutation groups
- Constructing error-correcting binary codes using transitive permutation groups
- Improved Semidefinite Programming Bound on Sizes of Codes
- Improved upper bounds on sizes of codes
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New upper bounds on codes via association schemes and linear programming
- On optimal binary codes with unbalanced coordinates
- On the failing cases of the Johnson bound for error-correcting codes
- Optimal binary one-error-correcting codes of length 10 have 72 codewords
- Semidefinite Code Bounds Based on Quadruple Distances
- The completion determination of optimal \((3,4)\)-packings
- Two new bounds on the size of binary codes with a minimum distance of three
- Two new four-error-correcting binary codes
- Two new nonlinear binary codes
Cited in
(3)
This page was built for publication: A simple proof of the improved Johnson bound for binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4968646)
