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

DOI10.1006/jcta.2002.3260zbMath1016.94044OpenAlexW1965348767MaRDI QIDQ1865378

Alfred Wassermann, Patric R. J. Östergård

Publication date: 26 March 2003

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

Full work available at URL: https://doi.org/10.1006/jcta.2002.3260

zbMATH Keywords

covering radiusternary codeLLL algorithmfootball pool problem

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (5)

On the minimum size of 4-uniform hypergraphs without property \(B\) ⋮ Using symmetry to optimize over the Sherali-Adams relaxation ⋮ New results on codes with covering radius 1 and minimum distance \(2\) ⋮ An updated table of binary/ternary mixed covering codes ⋮ Bounds for covering codes over large alphabets

Uses Software

• nauty

Cites Work

• Unnamed Item
• On the football pool problem for 6 matches: A new upper bound
• Attacking the market split problem with lattice point enumeration
• The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
• Lower bounds for \(q\)-ary coverings by spheres of radius one
• A combinatorial proof for the football pool problem for six matches
• New upper bounds for the football pool problem for 6, 7, and 8 matches
• Isomorph-Free Exhaustive Generation
• On the size of optimal binary codes of length 9 and covering radius 1
• The football pool problem for 5 matches
• Intersection Inequalities for the Covering Problem

This page was built for publication: A new lower bound for the football pool problem for six matches