A new lower bound for the football pool problem for six matches

Journal of Combinatorial Theory. Series A

Volumn 99, Issue 1, 2002, Pages 175-179

  Östergård, Patric R J ^a   Wassermann, Alfred ^b  

^a AALTO UNIVERSITY   (Finland)

^b UNIVERSITY OF BAYREUTH   (Germany)

Author keywords

Covering radius; Football pool problem; LLL algorithm; Ternary code

Indexed keywords

EID: 0036311282     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.2002.3260     Document Type: Article

References (13)

1. Lower bounds for q-ary coverings by spheres of radius one
2. The football pool problem for 5 matches
3. New upper bounds for the football pool problem for 6, 7, and 8 matches
4. "nauty User's Guide"
5. "autoson-A Distributed Batch System for UNIX Workstation Networks"
6. Isomorph-free exhaustive generation
7. A combinatorial proof for the football pool problem for six matches
8. On the size of optimal binary codes of length 9 and covering radius 1
9. Intersection inequalities for the covering problem
10. Finding simple t-designs with enumeration techniques
11. Attacking the market split problem with lattice basis reduction
12. On the football pool problem for 6 matches: A new upper bound
13. The football pool problem for 6 matches: A new upper bound obtained by simulated annealing