More coverings by rook domains

DOI10.1016/0097-3165(84)90010-4zbMath0533.05020OpenAlexW1981611633MaRDI QIDQ789394

Clement Wing Hong Lam, Aart Blokhuis

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(84)90010-4

zbMATH Keywords

football pool problemrook domain

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Related Items (21)

New upper bounds for the football pool problem for 11 and 12 matches ⋮ On \((p,1)\)-subnormal \(q\)-ary covering codes ⋮ Graph domination, tabu search and the football pool problem ⋮ The football pool problem for 6 matches: A new upper bound obtained by simulated annealing ⋮ Ternary covering codes derived from BCH codes ⋮ New upper bounds for binary covering codes ⋮ The covering problem in Rosenbloom-Tsfasman spaces ⋮ Projective tilings and full-rank perfect codes ⋮ Ordered covering arrays and upper bounds on covering codes ⋮ Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ Linear maps of perfect codes and irregular \(C\)-partitions ⋮ On lengthening of covering codes ⋮ A new upper bound for the football pool problem for nine matches ⋮ Hyper-rook Domain Inequalities ⋮ On kernels of perfect codes ⋮ New upper bounds for the football pool problem for 6, 7, and 8 matches ⋮ A connection between sumsets and covering codes of a module ⋮ On perfect \(p\)-ary codes of length \(p+1\) ⋮ Bounds for binary multiple covering codes ⋮ Bounds for covering codes over large alphabets ⋮ Hypercube Packings and Coverings with Higher Dimensional Rooks

Cites Work

• Unnamed Item
• The football pool problem for 5 matches
• Coverings by rook domains

This page was built for publication: More coverings by rook domains