On the football pool problem for 6 matches: A new upper bound

DOI10.1016/0097-3165(83)90032-8zbMath0526.05019OpenAlexW1989844940MaRDI QIDQ594884

Ewald W. Weber

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0097-3165(83)90032-8

zbMATH Keywords

outcome of football matchesternary Hamming code

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Related Items (6)

New upper bounds for the football pool problem for 11 and 12 matches ⋮ The football pool problem for 6 matches: A new upper bound obtained by simulated annealing ⋮ Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ Bounds for binary multiple covering codes ⋮ Upper bounds for football pool problems and mixed covering codes ⋮ A new lower bound for the football pool problem for six matches

Cites Work

• The football pool problem for 5 matches

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