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

DOI10.1016/0097-3165(94)90010-8zbMath0815.94023MaRDI 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 bounds; simulated annealing; covering codes; football pool problem; Hamming distance 1; minimizing the number of words in a code

Mathematics Subject Classification ID

94B65: Bounds on codes

94B99: Theory of error-correcting codes and error-detecting codes

05B40: Combinatorial aspects of packing and covering

Related Items

Graph domination, tabu search and the football pool problem, Ternary covering codes derived from BCH codes, \(K_{5}(7,3) \leqslant 100\)., Metaheuristics: A bibliography

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item