New upper bounds for the football pool problem for 11 and 12 matches

DOI10.1016/0097-3165(94)90010-8zbMath0815.94023OpenAlexW2055765087MaRDI QIDQ1331131

Patric R. J. Östergård

Publication date: 9 July 1995

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(94)90010-8

zbMATH Keywords

upper boundssimulated annealingcovering codesfootball pool problemHamming distance 1minimizing the number of words in a code

Mathematics Subject Classification ID

Bounds on codes (94B65) Theory of error-correcting codes and error-detecting codes (94B99) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

Graph domination, tabu search and the football pool problem ⋮ Ternary covering codes derived from BCH codes ⋮ Metaheuristics: A bibliography ⋮ The second-order football-pool problem and the optimal rate of generalized-covering codes ⋮ \(K_{5}(7,3) \leqslant 100\).

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• 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
• A new approach to the covering radius of codes
• The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
• Unit sphere packings and coverings of the Hamming space
• New upper bounds for the football pool problem for 6, 7, and 8 matches
• Hyper-rook Domain Inequalities
• A new binary code of length 10 and covering radius 1
• Upper bounds for q-ary covering codes
• Some new lower bounds for binary and ternary covering codes
• The football pool problem for 5 matches

This page was built for publication: New upper bounds for the football pool problem for 11 and 12 matches