Lower bounds for the football pool problem for 7 and 8 matches
From MaRDI portal
(Redirected from Lower bounds for the football pool problem for 7 and 8 matches)
Summary: Let \(k_3(n)\) denote the minimal cardinality of a ternary code of length \(n\) and covering radius one. In this paper we show \(k_3(7)\geq 156\) and \(k_3(8)\geq 402\) improving on the best previously known bounds \(k_3(7)\geq 153\) and \(k_3(8)\geq 398\). The proofs are founded on a recent technique of the author for dealing with systems of linear inequalities satisfied by the number of elements of a covering code, that lie in \(k\)-dimensional subspaces of \(\mathbb{F}_3^n\).
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
(10)- New upper bounds for the football pool problem for 11 and 12 matches
- Binary and ternary codes of covering radius one: some new lower bounds
- A new lower bound for the football pool problem for six matches
- An improved upper bound for the football pool problem for nine matches
- New upper bounds for the football pool problem for 6, 7, and 8 matches
- Several new lower bounds for football pool systems
- Hypercube packings and coverings with higher dimensional rooks
- Mixed binary/ternary covering codes
- A new lower bound for the football pool problem for 7 matches
- 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)
