New upper bounds for the football pool problem for 11 and 12 matches
- 31 August 1994
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 67 (2) , 161-168
- https://doi.org/10.1016/0097-3165(94)90010-8
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Some new lower bounds for binary and ternary covering codesIEEE Transactions on Information Theory, 1993
- Upper bounds for football pool problems and mixed covering codesJournal of Combinatorial Theory, Series A, 1991
- A new binary code of length 10 and covering radius 1IEEE Transactions on Information Theory, 1991
- New upper bounds for the football pool problem for 6, 7, and 8 matchesJournal of Combinatorial Theory, Series A, 1989
- The football pool problem for 6 matches: A new upper bound obtained by simulated annealingJournal of Combinatorial Theory, Series A, 1987
- A new approach to the covering radius of codesJournal of Combinatorial Theory, Series A, 1986
- More coverings by rook domainsJournal of Combinatorial Theory, Series A, 1984
- The football pool problem for 7 and 8 matchesJournal of Combinatorial Theory, Series A, 1983
- On the football pool problem for 6 matches: A new upper boundJournal of Combinatorial Theory, Series A, 1983
- Optimization by Simulated AnnealingScience, 1983