Geodesic
Lower bounds for the football pool problem for 7 and 8 matches
The electronic journal of combinatorics, Tome 14 (2007)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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)\ge 156$ and $k_3(8)\ge 402$ improving on the best previously known bounds $k_3(7)\ge 153$ and $k_3(8)\ge 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 F${}_3^n$.
DOI : 10.37236/945
Classification : 94B65, 94B05 
@article{10_37236_945,
     author = {Wolfgang Haas},
     title = {Lower bounds for the football pool problem for 7 and 8 matches},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/945},
     zbl = {1147.94016},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/945/}
}
TY  - JOUR
AU  - Wolfgang Haas
TI  - Lower bounds for the football pool problem for 7 and 8 matches
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/945/
DO  - 10.37236/945
ID  - 10_37236_945
ER  - 
%0 Journal Article
%A Wolfgang Haas
%T Lower bounds for the football pool problem for 7 and 8 matches
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/945/
%R 10.37236/945
%F 10_37236_945
Wolfgang Haas. Lower bounds for the football pool problem for 7 and 8 matches. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/945

Cité par Sources :