Note: a new lower bound for the football pool problem for six matches

Authors:
Patric R. J. östergård;Alfred Wassermann
Affiliations:
Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, 02015 HUT, Finland;Department of Mathematics, University of Bayreuth, 95440 Bayreuth, Germany
Venue:
Journal of Combinatorial Theory Series A
Year:
2002

Citing 6
Cited 4

The football pool problem for 6 matches: A new upper bound obtained by simulated annealing

Journal of Combinatorial Theory Series A
New upper bounds for the football pool problem for 6, 7, and 8 matches

Journal of Combinatorial Theory Series A
Lower bounds for q-ary coverings by spheres of radius one

Journal of Combinatorial Theory Series A
A combinatorial proof for the football pool problem for six matches

Journal of Combinatorial Theory Series A
Isomorph-free exhaustive generation

Journal of Algorithms
On the size of optimal binary codes of length 9 and covering radius 1

IEEE Transactions on Information Theory

New Results on Codes with Covering Radius 1 and Minimum Distance 2

Designs, Codes and Cryptography
Bounds for Covering Codes over Large Alphabets

Designs, Codes and Cryptography
Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing

INFORMS Journal on Computing
On the minimum size of 4-uniform hypergraphs without property B

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.