Upper bounds for football pool problems and mixed covering codes
From MaRDI portal
(Redirected from Publication:753795)
Recommendations
Cites work
- scientific article; zbMATH DE number 3869218 (Why is no real title available?)
- scientific article; zbMATH DE number 4106873 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3054152 (Why is no real title available?)
- A new construction for covering codes
- Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
- Covering radius---Survey and recent results
- Further results on the covering radius of codes
- Generalized bounds and binary/ternary mixed packing and covering codes
- Improved sphere bounds on the covering radius of codes
- Lower bounds for binary covering codes
- Lower bounds for q-ary covering codes
- Modified bounds for covering codes
- New upper bounds for the football pool problem for 6, 7, and 8 matches
- On normal and subnormal q-ary codes
- On the covering radius of codes
- On the football pool problem for 6 matches: A new upper bound
- The football pool problem for 5 matches
- The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
- The football pool problem for 7 and 8 matches
Cited in
(15)- Hypercube packings and coverings with higher dimensional rooks
- At the dawn of the theory of codes
- New upper bounds for the football pool problem for 6, 7, and 8 matches
- Bounds on the sizes of constant weight covering codes
- Further results on multiple coverings of the farthest-off points
- Additive cyclic codes over mixed alphabets and the football pool problem
- Generalized bounds and binary/ternary mixed packing and covering codes
- Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
- New upper bounds for the football pool problem for 11 and 12 matches
- Bounds for binary multiple covering codes
- An updated table of binary/ternary mixed covering codes
- On lengthening of covering codes
- Graph domination, tabu search and the football pool problem
- A new upper bound for the football pool problem for nine matches
- Multiple coverings of the farthest-off points with small density from projective geometry
This page was built for publication: Upper bounds for football pool problems and mixed covering codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753795)
