The football pool problem for 6 matches: A new upper bound obtained by simulated annealing

A New Table of Binary/Ternary Mixed Covering Codes

Designs, Codes and Cryptography

Constructing Covering Codes with Given Automorphisms

Designs, Codes and Cryptography

Annealed Embeddings of Communication Patterns in an Interconnection Cached Network

IEEE Transactions on Parallel and Distributed Systems

Note: a new lower bound for the football pool problem for six matches

Journal of Combinatorial Theory Series A

K5(7,3)≤100

Journal of Combinatorial Theory Series A

Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing

INFORMS Journal on Computing