The second-order football-pool problem and the optimal rate of generalized-covering codes

DOI10.1016/j.jcta.2023.105834arXiv2210.00531MaRDI QIDQ6187334

Dor Elimelech, Moshe Schwartz

Publication date: 15 January 2024

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

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

zbMATH Keywords

covering codesgeneralized covering radiusfootball-pool problem

Mathematics Subject Classification ID

Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Good coverings of Hamming spaces with spheres
• The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
• New upper bounds for the football pool problem for 11 and 12 matches
• New upper bounds for the football pool problem for 6, 7, and 8 matches
• Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing
• Generalized Hamming weights for linear codes
• Football Pools--A Game for Mathematicians
• The Generalized Covering Radii of Linear Codes
• On the Generalized Covering Radii of Reed-Muller Codes
• New Bounds on the Capacity of Multidimensional Run-Length Constraints
• The football pool problem for 5 matches
• Negative Moments of Positive Random Variables

This page was built for publication: The second-order football-pool problem and the optimal rate of generalized-covering codes