A new table of binary/ternary mixed covering codes

DOI10.1023/A:1008228721072MaRDI QIDQ1358675zbMATHOpenAlexFDO

Authors Patric R. J. Östergård, Heikki O. Hämäläinen

Publication date 9 October 1997

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008228721072

zbMATH Keywords

simulated annealingcovering codefootball pool problemmixed codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Several new lower bounds for football pool systems
• Upper bounds for football pool problems and mixed covering codes
• scientific article; zbMATH DE number 1161255
• Binary and ternary codes of covering radius one: some new lower bounds
• Some new lower bounds for ternary covering codes

Cited in

(14)

• Multiple coverings of the farthest-off points with small density from projective geometry
• Several new lower bounds for football pool systems
• scientific article; zbMATH DE number 4106873 (Why is no real title available?)
• New upper bounds for binary covering codes
• Constructions, families, and tables of binary linear covering codes
• Graph domination, tabu search and the football pool problem
• Bounds for covering codes over large alphabets
• Constructing covering codes via automorphisms
• A combinatorial proof for the football pool problem for six matches
• Further results on multiple coverings of the farthest-off points
• Upper bounds for football pool problems and mixed covering codes
• The second-order football-pool problem and the optimal rate of generalized-covering codes
• An updated table of binary/ternary mixed covering codes
• Ternary Hamming and binary perfect covering codes

This page was built for publication: A new table of binary/ternary mixed covering codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1358675)