Title of article
A New Lower Bound for the Football Pool Problem for Six Matches
Author/Authors
ضstergهrd، نويسنده , , Patric R.J. and Wassermann، نويسنده , , Alfred، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
5
From page
175
To page
179
Abstract
In the football pool problem one wants to minimize the cardinality of a ternary code, C⊆F3n, with covering radius one, and the size of a minimum code is denoted by σn. The smallest unsettled case is 63⩽σ6⩽73. The lower bound is here improved to 65 in a coordinate-by-coordinate backtrack search using the LLL algorithm and complete equivalence checking of subcodes.
Keywords
ternary code , Covering radius , football pool problem , LLL algorithm
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2002
Journal title
Journal of Combinatorial Theory Series A
Record number
1530732
Link To Document