Bounds for binary multiple covering codes
From MaRDI portal
Recommendations
Cites work
- A new approach to the covering radius of codes
- A new construction for covering codes
- A note on perfect multiple coverings of the Hamming space
- All binary codes with covering radius one are subnormal
- An improved sphere covering bound for the codes with n=3R+2
- Binary linear quasi-perfect codes are normal
- Bounds for abnormal binary codes with covering radius one
- Covering radius---Survey and recent results
- Further results on (k, t)-subnormal covering codes
- Further results on the covering radius of codes
- scientific article; zbMATH DE number 4104866 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 493080 (Why is no real title available?)
- 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 binary covering codes
- Modified bounds for covering codes
- More binary covering codes are normal
- More coverings by rook domains
- New lower bounds for binary covering codes
- New upper bounds for the football pool problem for 6, 7, and 8 matches
- On (k, t)-subnormal covering codes
- On \((p,1)\)-subnormal \(q\)-ary covering codes
- On normal and subnormal q-ary codes
- 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
- On the football pool problem for 6 matches: A new upper bound
- Some results on the norm of codes
- Upper bounds for football pool problems and mixed covering codes
- Upper bounds for q-ary covering codes
Cited in
(16)- On lengthening of covering codes
- New upper bounds for binary covering codes
- Exact bounds on the sizes 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
- New lower bounds for multiple coverings
- Code bounds for multiple packings over a nonbinary finite alphabet
- Covering the Hamming space with sets translated by linear code vectors
- Further results on multiple coverings of the farthest-off points
- A note on perfect multiple coverings of the Hamming space
- scientific article; zbMATH DE number 4065003 (Why is no real title available?)
- scientific article; zbMATH DE number 2170443 (Why is no real title available?)
- Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points
- scientific article; zbMATH DE number 825138 (Why is no real title available?)
- Modified bounds for covering codes
- Generalized bounds and binary/ternary mixed packing and covering codes
This page was built for publication: Bounds for binary multiple covering codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1261015)
