Hypercube Packings and Coverings with Higher Dimensional Rooks

zbMath1444.05037arXiv1801.10607MaRDI QIDQ3300685

David Stoner, Mehtaab Sawhney

Publication date: 29 July 2020

Full work available at URL: https://arxiv.org/abs/1801.10607

zbMATH Keywords

sphere packing bound\(q\)-ary codes

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Other types of codes (94B60) Combinatorial aspects of packing and covering (05B40)

Cites Work

• The football pool problem for 7 and 8 matches
• Upper bounds for football pool problems and mixed covering codes
• More coverings by rook domains
• Lower bounds for the football pool problem for 7 and 8 matches
• Lower bounds on covering codes via partition matrices
• A new upper bound for the football pool problem for nine matches
• New upper bounds for binary covering codes
• A Combinatorial Problem in Matching
• Coverings by rook domains
• Maximum distance<tex>q</tex>-nary codes

This page was built for publication: Hypercube Packings and Coverings with Higher Dimensional Rooks