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

Journal of Combinatorial Theory, Series A

Volumn 67, Issue 2, 1994, Pages 161-168

  Östergård, Patric R J ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040414520     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/0097-3165(94)90010-8     Document Type: Article

References (22)

1. More coverings by rook domains
2. Hyper-rook domain inequalities
3. The football pool problem for 7 and 8 matches
4. Upper bounds for football pool problems and mixed covering codes
5. Unit sphere packings and coverings of the Hamming space
6. The football pool problem for 5 matches
7. A covering problem
8. Optimization by simulated annealing
9. New upper bounds for the football pool problem for 6, 7 and 8 matches
10. Covering Radius Problems
11. A new binary code of length 10 and covering radius 1
12. Upper bounds for q-ary covering codes
13. Upper bounds for q-ary covering codes
14. Some further theory of group codes
15. A new approach to the covering radius of codes
16. On the football pool problem for 6 matches: A new upper bound
17. Some new lower bounds for binary and ternary covering codes
18. The football pool problem for 6 matches: A new upper bound obtained by simulated annealing