Minimal coverings of \0, 1, 2\^n with spheres of radius n

MaRDI QIDQ5354539zbMATH OpenFDO

Authors Emil Kolev, Tsonka Stefanova Baicheva

Publication date 4 September 2017

zbMATH Keywords

football poolsgamblingminimal covering

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory (05C90) Probabilistic games; gambling (91A60)

Recommendations

• About the inverse football pool problem for 9 games
• The inverse football pool problem
• An improved sphere covering bound for the codes with n=3R+2
• Improved sphere bounds on the covering radius of codes
• Lower bounds for \(q\)-ary coverings by spheres of radius one

Cited in

(6)

• Sphere coverings and identifying codes
• scientific article; zbMATH DE number 5630518 (Why is no real title available?)
• \((n,m)\)-fold covers of spheres
• Toroidal boards and code covering
• About the inverse football pool problem for 9 games
• The Covering of n -Dimensional Space by Spheres

This page was built for publication: Minimal coverings of \({\{0, 1, 2\}}^n\) with spheres of radius \(n\)

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