Binary codes with covering radius one: Some new lower bounds
From MaRDI portal
(Redirected from Publication:1377682)
Recommendations
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
(11)- Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space
- scientific article; zbMATH DE number 1522570 (Why is no real title available?)
- 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)
