Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
From MaRDI portal
Publication:1176382
DOI10.1016/0097-3165(91)90010-EzbMath0755.94013OpenAlexW2114044186MaRDI QIDQ1176382
Publication date: 25 June 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(91)90010-e
Related Items
Lower bounds for \(q\)-ary coverings by spheres of radius one, Binary codes with covering radius one: Some new lower bounds, At the dawn of the theory of codes, Upper bounds for football pool problems and mixed covering codes, Fundamentals of coding type problems, Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space, An updated table of binary/ternary mixed covering codes, Bounds for covering codes over large alphabets, Generalized bounds and binary/ternary mixed packing and covering codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the football pool problem for 6 matches: A new upper bound
- The football pool problem for 7 and 8 matches
- Upper bounds for football pool problems and mixed covering codes
- More coverings by rook domains
- Generalized bounds and binary/ternary mixed packing and covering codes
- On covering and coloring problems for rook domains
- The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
- New upper bounds for the football pool problem for 6, 7, and 8 matches
- On covering sets and error-correcting codes
- Lower bounds for q-ary covering codes
- Further results on the covering radius of codes
- Lower bounds for binary covering codes
- Improved sphere bounds on the covering radius of codes
- A new construction for covering codes
- The football pool problem for 5 matches
- Note on a theorem of Zaremba
- A Combinatorial Problem in Matching
- Intersection Inequalities for the Covering Problem
- Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
- Coverings by rook domains
- On a Covering Problem Concerning Abelian Groups
- Rook domains, Latin squares, affine planes, and error-distributing codes
- Modified bounds for covering codes
- COVERING THEOREMS FOR GROUPS
- A Covering Theorem for Abelian Groups
- Covering Problems Concerning Abelian Groups
- The hardness of solving subset sum with preprocessing
- Covering problems for dichotomized matchings
