On optimal binary codes with unbalanced coordinates

DOI10.1007/s00200-013-0189-9zbMath1283.94147OpenAlexW2013428639MaRDI QIDQ371241

Patric R. J. Östergård

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

zbMATH Keywords

classificationbounds on codesoptimal codeerror-correcting codebalanced codecode equivalence

Mathematics Subject Classification ID

Bounds on codes (94B65) Other types of codes (94B60)

Related Items (3)

Non-uniform covering array with symmetric forbidden edge constraints ⋮ A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES ⋮ The sextuply shortened binary Golay code is optimal

Uses Software

• Cliquer

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

This page was built for publication: On optimal binary codes with unbalanced coordinates