On optimal binary codes with unbalanced coordinates

DOI10.1007/S00200-013-0189-9zbMATH Open1283.94147OpenAlexW2013428639MaRDI QIDQ371241FDOQ371241

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

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

zbMATH Keywords

classificationbounds on codesoptimal codeerror-correcting codebalanced codecode equivalence

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Classification algorithms for codes and designs
• Title not available (Why is that?)
• Two new nonlinear binary codes
• Further results on the covering radius of codes
• New family of single-error correcting codes
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• A table of upper bounds for binary codes
• Semidefinite Code Bounds Based on Quadruple Distances
• 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
• Efficient balanced codes
• Improved upper bounds on sizes of codes
• Disproof of a conjecture on the existence of balanced optimal covering codes
• On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16
• A NEW FAMILY OF NONLINEAR CODES OBTAINED FROM CONFERENCE MATRICES
• New upper bounds on codes via association schemes and linear programming

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

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)