A new lower bound for the football pool problem for six matches

摘要

In the football pool problem one wants to minimize the cardinality of a tertiary code, C subset of or equal to F-3(n), with covering radius one, and the size of a minimum code is denoted by a,. The smallest unsettled case is 63 less than or equal to sigma(b) less than or equal to 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. (C) 2002 Elsevier Science (USA). [References: 13]