Upper bounds for football pool problems and mixed covering codes
type: Item
instance of: scholarly article
title: Upper bounds for football pool problems and mixed covering codes
zbMATH Open document ID: 0716.94013
DOI: 10.1016/0097-3165(91)90024-B
author: Seppo Rankinen
author: Heikki O. Hämäläinen
published in: Journal of Combinatorial Theory. Series A
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 94B25
zbMATH DE Number: 4181288
zbMATH Keywords: football pool problems
zbMATH Keywords: mixed covering codes
zbMATH Keywords: Hamming distance
zbMATH Keywords: covering radius
MaRDI profile type: Publication
cites work: Lower bounds for q-ary covering codes
cites work: Covering radius---Survey and recent results
cites work: Further results on the covering radius of codes
cites work: The football pool problem for 7 and 8 matches
cites work: On the covering radius of codes
cites work: Lower bounds for binary covering codes
cites work: Modified bounds for covering codes
cites work: A new construction for covering codes
cites work: The football pool problem for 5 matches
cites work: New upper bounds for the football pool problem for 6, 7, and 8 matches
cites work: Q3831025
cites work: Generalized bounds and binary/ternary mixed packing and covering codes
cites work: On normal and subnormal q-ary codes
cites work: Q4146667
cites work: Q5793375
cites work: Q3337376
cites work: On the football pool problem for 6 matches: A new upper bound
cites work: Improved sphere bounds on the covering radius of codes
cites work: Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
cites work: The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
description: scientific article; zbMATH DE number 4181288