New upper bounds for the football pool problem for 11 and 12 matches
type: Item
instance of: scholarly article
title: New upper bounds for the football pool problem for 11 and 12 matches
zbMATH Open document ID: 0815.94023
DOI: 10.1016/0097-3165(94)90010-8
author: Patric R. J. Östergård
published in: Journal of Combinatorial Theory. Series A
publication date: 1995-07-09T00:00:00Z
Mathematics Subject Classification ID: 94B99
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 617598
zbMATH Keywords: upper bounds
zbMATH Keywords: covering codes
zbMATH Keywords: simulated annealing
zbMATH Keywords: minimizing the number of words in a code
zbMATH Keywords: Hamming distance 1
zbMATH Keywords: football pool problem
MaRDI profile type: Publication
full work available at URL: 0097-3165(94)90010-8
OpenAlex ID: W2055765087
cites work: Q3994799
cites work: More coverings by rook domains
cites work: Hyper-rook Domain Inequalities
cites work: The football pool problem for 7 and 8 matches
cites work: Upper bounds for football pool problems and mixed covering codes
cites work: Unit sphere packings and coverings of the Hamming space
cites work: The football pool problem for 5 matches
cites work: Q5638345
cites work: Optimization by Simulated Annealing
cites work: Q3785827
cites work: New upper bounds for the football pool problem for 6, 7, and 8 matches
cites work: Q3831025
cites work: Q4146667
cites work: A new binary code of length 10 and covering radius 1
cites work: Upper bounds for q-ary covering codes
cites work: A new approach to the covering radius of codes
cites work: On the football pool problem for 6 matches: A new upper bound
cites work: Some new lower bounds for binary and ternary covering codes
cites work: The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
Recommended article: New upper bounds for the football pool problem for 6, 7, and 8 matches
Recommended article: A new upper bound for the football pool problem for nine matches
Recommended article: An improved upper bound for the football pool problem for nine matches
Recommended article: A new lower bound for the football pool problem for six matches
Recommended article: Several new lower bounds for football pool systems
Recommended article: A new lower bound for the football pool problem for 7 matches
Recommended article: Lower bounds for the football pool problem for 7 and 8 matches
Recommended article: Improving bounds on the football pool problem by integer programming and high-throughput computing
Recommended article: The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
Recommended article: Upper bounds for football pool problems and mixed covering codes
description: scientific article; zbMATH DE number 617598