Binary codes with covering radius one: Some new lower bounds

DOI10.1016/S0012-365X(96)00290-7zbMath0898.94016MaRDI QIDQ1377682

Laurent Habsieger

Publication date: 26 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

binary codeslower boundsminimum cardinalitycovering radius one

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)

Related Items (4)

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 ⋮ Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space

Cites Work

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

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