A new upper bound for the football pool problem for nine matches

DOI10.1016/0097-3165(93)90079-NzbMath0767.05038MaRDI QIDQ1208049

Klaus-Uwe Koschnick

Publication date: 16 May 1993

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

upper boundapproximation algorithmconfigurationHamming distancecoverfootball pool problemnine matches

Mathematics Subject Classification ID

Lattice packing and covering (number-theoretic aspects) (11H31) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

Graph domination, tabu search and the football pool problem ⋮ Hypercube Packings and Coverings with Higher Dimensional Rooks

Cites Work

• Upper bounds for football pool problems and mixed covering codes
• More coverings by rook domains
• New upper bounds for the football pool problem for 6, 7, and 8 matches
• The football pool problem for 5 matches
• Some new constant weight codes
• Unnamed Item
• Unnamed Item

This page was built for publication: A new upper bound for the football pool problem for nine matches