Binary codes with covering radius one: Some new lower bounds

DOI10.1016/S0012-365X(96)00290-7zbMATH Open0898.94016MaRDI QIDQ1377682FDOQ1377682

Authors: Laurent Habsieger 

Publication date: 26 January 1998

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

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

zbMATH Keywords

lower boundsbinary codesminimum 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)

Cites Work

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

Cited In (11)

• Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space
• Title not available (Why is that?)
• On the general excess bound for binary codes with covering radius one
• Some new upper bounds on the covering radius of binary linear codes
• On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
• Combinatorial lower bounds on binary codes with covering radius one
• Some new lower bounds for binary and ternary covering codes
• On the general excess bound for binary codes with covering radius one
• On the size of optimal binary codes of length 9 and covering radius 1
• On the covering radius of binary codes (Corresp.)
• A new lower bound for the football pool problem for 7 matches

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)