Bounds for binary multiple covering codes
From MaRDI portal
Publication:1261015
DOI10.1007/BF01388486zbMath0771.94009OpenAlexW2080892006MaRDI QIDQ1261015
Markku K. Kaikkonen, Simon N. Litsyn, Iiro S. Honkala, Heikki O. Hämäläinen
Publication date: 29 August 1993
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01388486
Related Items
New lower bounds for multiple coverings ⋮ Further results on multiple coverings of the farthest-off points ⋮ New upper bounds for binary covering codes ⋮ On lengthening of covering codes ⋮ Multiple coverings of the farthest-off points with small density from projective geometry ⋮ Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the football pool problem for 6 matches: A new upper bound
- Upper bounds for football pool problems and mixed covering codes
- More coverings by rook domains
- A new approach to the covering radius of codes
- All binary codes with covering radius one are subnormal
- On \((p,1)\)-subnormal \(q\)-ary covering codes
- New upper bounds for the football pool problem for 6, 7, and 8 matches
- An improved sphere covering bound for the codes with n=3R+2
- More binary covering codes are normal
- Linear inequalities for covering codes. I. Pair covering inequalities
- Upper bounds for q-ary covering codes
- A note on perfect multiple coverings of the Hamming space
- On (k, t)-subnormal covering codes
- On normal and subnormal q-ary codes
- Some results on the norm of codes
- On the covering radius of codes
- Covering radius---Survey and recent results
- Further results on the covering radius of codes
- On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius
- On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
- Lower bounds for binary covering codes
- Improved sphere bounds on the covering radius of codes
- A new construction for covering codes
- Further results on (k, t)-subnormal covering codes
- Linear inequalities for covering codes. II. Triple covering inequalities
- New lower bounds for binary covering codes
- Bounds for abnormal binary codes with covering radius one
- Binary linear quasi-perfect codes are normal
- Modified bounds for covering codes
