Binary codes with covering radius one: Some new lower bounds

DOI10.1016/S0012-365X(96)00290-7MaRDI QIDQ1377682zbMATH OpenFDO

Authors Laurent Habsieger

Publication date 26 January 1998

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(96)00290-7

zbMATH Keywords

binary codescovering radius onelower boundsminimum cardinality

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Review text

This paper is devoted to the study of binary codes of length \(n\) with covering radius one via their characteristic functions. The author uses the method of congruence properties for sphere shells to get improvements on the lower bounds of \(K(n,1)\) (the minimum cardinality of such a code). The following special cases are treated: \(n\equiv 5\bmod 6\), \(n\equiv 1,3 \bmod 6\) and \(n\equiv 2,4\bmod 6\). The author gives an updated version of the lower bounds for \(K(n,1)\), \(n\leq 33\).

Recommendations

• Combinatorial lower bounds on binary codes with covering radius one
• Several new lower bounds on the size of codes with covering radius one
• scientific article; zbMATH DE number 1456810
• Some new lower bounds for binary and ternary covering codes

Cites work

• Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
• Combinatorial lower bounds on binary codes with covering radius one
• Further results on the covering radius of codes
• Improved sphere bounds on the covering radius of codes
• Linear inequalities for covering codes. I. Pair covering inequalities
• Linear inequalities for covering codes. II. Triple covering inequalities
• Lower bounds for \(q\)-ary coverings by spheres of radius one
• Lower bounds for q-ary covering codes
• Modified bounds for covering codes
• Some new lower bounds for binary and ternary covering codes

Cited in

(14)

• On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
• Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space
• Combinatorial lower bounds on binary codes with covering radius one
• Some new upper bounds on the covering radius of binary linear codes
• On the covering radius of binary codes (Corresp.)
• Some new lower bounds for binary and ternary covering codes
• scientific article; zbMATH DE number 1522570 (Why is no real title available?)
• On the size of optimal binary codes of length 9 and covering radius 1
• Several new lower bounds on the size of codes with covering radius one
• scientific article; zbMATH DE number 1456810 (Why is no real title available?)
• On the general excess bound for binary codes with covering radius one
• On the general excess bound for binary codes with covering radius one
• A new lower bound for the football pool problem for 7 matches
• On the Hasse diagram of binary linear codes

This page was built for publication: Binary codes with covering radius one: Some new lower bounds

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