On optimal binary codes with unbalanced coordinates

DOI10.1007/S00200-013-0189-9MaRDI QIDQ371241zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Disproof of a conjecture on the existence of balanced optimal covering codes
• On error-correcting balanced codes
• scientific article; zbMATH DE number 3463504
• Bounds for binary codes of length less than 25
• The sextuply shortened binary Golay code is optimal

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• A NEW FAMILY OF NONLINEAR CODES OBTAINED FROM CONFERENCE MATRICES
• A table of upper bounds for binary codes
• Classification algorithms for codes and designs
• Covering arrays on graphs
• Disproof of a conjecture on the existence of balanced optimal covering codes
• Efficient balanced codes
• Further results on the covering radius of codes
• Improved upper bounds on sizes of codes
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• New family of single-error correcting codes
• New upper bounds on codes via association schemes and linear programming
• On balanced codes
• On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16
• On the failing cases of the Johnson bound for error-correcting codes
• Semidefinite Code Bounds Based on Quadruple Distances
• Two new four-error-correcting binary codes
• Two new nonlinear binary codes

Cited in

(8)

• The sextuply shortened binary Golay code is optimal
• Nonexistence of binary codes uniformly distributed over balls
• Explicit, almost optimal, epsilon-balanced codes
• On efficient balanced codes over the mth roots of unity
• Disproof of a conjecture on the existence of balanced optimal covering codes
• Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs
• A simple proof of the improved Johnson bound for binary codes
• Non-uniform covering array with symmetric forbidden edge constraints

Describes a project that uses

Uses Software

• Cliquer

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q371241)