Modified bounds for covering codes
From MaRDI portal
Recommendations
- Covering bounds for codes
- On lower bounds for covering codes
- New lower bounds for covering codes
- New lower bounds for covering codes
- Bounds for binary multiple covering codes
- New upper bounds for binary covering codes
- Improved lower bounds for multicovering codes
- Exact bounds on the sizes of covering codes
- New lower bounds for binary covering codes
- Lower bounds for binary covering codes
Cited in
(18)- Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
- All binary codes with covering radius one are subnormal
- Bounds for binary multiple covering codes
- On the normality of multiple covering codes
- Lower bounds for \(q\)-ary coverings by spheres of radius one
- On \((p,1)\)-subnormal \(q\)-ary covering codes
- Long binary narrow-sense BCH codes are normal
- Binary codes with covering radius one: Some new lower bounds
- New upper bounds for binary covering codes
- Bounds on the sizes of constant weight covering codes
- Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space
- Bounds for covering codes over large alphabets
- On generalized surjective codes
- Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four
- Frequency computation and bounded queries
- A Graham-Sloane type construction for \(s\)-surjective matrices
- Upper bounds for football pool problems and mixed covering codes
- Further results on the covering radius of small codes
This page was built for publication: Modified bounds for covering codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753891)
