Lower bounds for the football pool problem for 7 and 8 matches

MaRDI QIDQ872721zbMATH OpenFDO

Authors Wolfgang Haas

Publication date 28 March 2007

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/129299, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r27.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• A new lower bound for the football pool problem for 7 matches
• A combinatorial proof for the football pool problem for six matches
• Several new lower bounds for football pool systems
• An improved upper bound for the football pool problem for nine matches
• A new lower bound for the football pool problem for six matches

Cited in

(9)

• New upper bounds for the football pool problem for 11 and 12 matches
• Several new lower bounds for football pool systems
• An improved upper bound for the football pool problem for nine matches
• Binary and ternary codes of covering radius one: some new lower bounds
• New upper bounds for the football pool problem for 6, 7, and 8 matches
• Hypercube packings and coverings with higher dimensional rooks
• A new lower bound for the football pool problem for six matches
• Mixed binary/ternary covering codes
• Upper bounds for football pool problems and mixed covering codes

This page was built for publication: Lower bounds for the football pool problem for 7 and 8 matches

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