On the size of optimal binary codes of length 9 and covering radius 1

DOI10.1109/18.945268MaRDI QIDQ4544695zbMATH OpenOpenAlexFDO

Authors Patric R. J. Östergård, Uri Blass

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.945268

zbMATH Keywords

code equivalencecovering codelinear programmingnonlinear codesoptimal codesweighted codes

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• scientific article; zbMATH DE number 1522570
• On the covering radius of binary codes (Corresp.)
• scientific article; zbMATH DE number 4160649
• Binary codes with covering radius one: Some new lower bounds
• On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
• Some bounds for the minimum length of binary linear codes of dimension nine
• On the least covering radius of binary linear codes with small lengths
• On covering radius lower bound for a class of binary codes
• Publication:4886131
• Some new results on the minimum length of binary linear codes of dimension nine

Cited in

(19)

• A remark on Haas' method
• New results on codes with covering radius 1 and minimum distance 2
• A new lower bound for the football pool problem for six matches
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• On solving a hard quadratic 3-dimensional assignment problem
• A new binary code of length 10 and covering radius 1
• Some new results on the minimum length of binary linear codes of dimension nine
• Classification of binary covering codes
• Disproof of a conjecture on the existence of balanced optimal covering codes
• An updated table of binary/ternary mixed covering codes
• New binary covering codes obtained by simulated annealing
• (Total) domination in prisms
• On the minimum length of linear codes over the field of 9 elements
• Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one
• Packings in bipartite prisms and hypercubes
• Switching codes and designs
• Resolution of a conjecture on the covering radius of linear codes
• Total and paired domination stability in prisms
• Induced matching vs edge open packing: trees and product graphs

Describes a project that uses

Uses Software

• nauty

This page was built for publication: On the size of optimal binary codes of length 9 and covering radius 1

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