An improved upper bound for the football pool problem for nine matches

DOI10.1016/S0097-3165(03)00010-4zbMath1023.94021OpenAlexW2029755004MaRDI QIDQ1873825

Franco Di Pasquale, Patric R. J. Östergård

Publication date: 27 May 2003

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

Full work available at URL: https://doi.org/10.1016/s0097-3165(03)00010-4

zbMATH Keywords

automorphism groupcovering codefootball pool problem

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

An updated table of binary/ternary mixed covering codes

Cites Work

• Some new lower bounds for ternary covering codes
• The football pool problem for 5 matches
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved upper bound for the football pool problem for nine matches