Upper bounds for football pool problems and mixed covering codes

DOI10.1016/0097-3165(91)90024-BzbMath0716.94013MaRDI QIDQ753795

Seppo Rankinen, Heikki O. Hämäläinen

Publication date: 1991

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

covering radiusHamming distancefootball pool problemsmixed covering codes

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items

New upper bounds for the football pool problem for 11 and 12 matches, Graph domination, tabu search and the football pool problem, Further results on multiple coverings of the farthest-off points, Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces, On lengthening of covering codes, A new upper bound for the football pool problem for nine matches, At the dawn of the theory of codes, Multiple coverings of the farthest-off points with small density from projective geometry, Bounds on the sizes of constant weight covering codes, Bounds for binary multiple covering codes, An updated table of binary/ternary mixed covering codes, Generalized bounds and binary/ternary mixed packing and covering codes, Hypercube Packings and Coverings with Higher Dimensional Rooks

Cites Work

• 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
• Generalized bounds and binary/ternary mixed packing and covering codes
• The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
• Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
• New upper bounds for the football pool problem for 6, 7, and 8 matches
• On normal and subnormal q-ary codes
• Lower bounds for q-ary covering codes
• On the covering radius of codes
• Covering radius---Survey and recent results
• 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
• Modified bounds for covering codes