Title of article
An improved upper bound for the football pool problem for nine matches
Author/Authors
Di Pasquale، نويسنده , , Franco and ضstergهrd، نويسنده , , Patric R.J، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
3
From page
204
To page
206
Abstract
The problem of determining K3(n,1), the minimum size of a ternary code of length n and covering radius 1, is called the football pool problem. By construction, it is here shown that K3(9,1)⩽1269. A code whose full automorphism group has order 648 is given, but this bound is actually achieved by a vast number of inequivalent codes.
Keywords
Automorphism group , covering code , football pool problem
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2003
Journal title
Journal of Combinatorial Theory Series A
Record number
1530784
Link To Document