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

DOI10.5802/JTNB.183MaRDI QIDQ679112zbMATH OpenOpenAlexFDO

Authors Laurent Habsieger

Publication date 13 July 1997

Published in Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=JTNB_1996__8_2_481_0, https://eudml.org/doc/226013, http://www.emis.de/journals/JTNB/1996-2/jtnb8-2.html

zbMATH Keywords

covering radiusternary code

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)

Recommendations

• Lower bounds for the football pool problem for 7 and 8 matches
• An improved upper bound for the football pool problem for nine matches
• Several new lower bounds for football pool systems
• A new lower bound for the football pool problem for six matches
• scientific article; zbMATH DE number 1161255

Cites work

• Binary codes with covering radius one: Some new lower bounds
• Covering radius 1985-1994
• Lower bounds for \(q\)-ary coverings by spheres of radius one
• Lower bounds for q-ary covering codes

Cited in

(6)

• Lower bounds for the football pool problem for 7 and 8 matches
• New upper bounds for the football pool problem for 6, 7, and 8 matches
• New upper bounds for the football pool problem for 11 and 12 matches
• An improved upper bound for the football pool problem for nine matches
• A new upper bound for the football pool problem for nine matches
• A new lower bound for the football pool problem for six matches

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679112)