On optimal binary codes with unbalanced coordinates
From MaRDI portal
Publication:371241
DOI10.1007/s00200-013-0189-9zbMath1283.94147MaRDI QIDQ371241
Publication date: 30 September 2013
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-013-0189-9
classification; bounds on codes; optimal code; error-correcting code; balanced code; code equivalence
Related Items
A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES, Non-uniform covering array with symmetric forbidden edge constraints, The sextuply shortened binary Golay code is optimal
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New upper bounds on codes via association schemes and linear programming
- Classification algorithms for codes and designs
- On the failing cases of the Johnson bound for error-correcting codes
- Covering arrays on graphs
- Two new four-error-correcting binary codes
- On balanced codes
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Efficient balanced codes
- Further results on the covering radius of codes
- A table of upper bounds for binary codes
- Improved upper bounds on sizes of codes
- Disproof of a conjecture on the existence of balanced optimal covering codes
- Semidefinite Code Bounds Based on Quadruple Distances
- On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16
- New family of single-error correcting codes
- A NEW FAMILY OF NONLINEAR CODES OBTAINED FROM CONFERENCE MATRICES
