A new table of binary/ternary mixed covering codes

DOI10.1023/A:1008228721072zbMATH Open0872.94056OpenAlexW1523264473MaRDI QIDQ1358675FDOQ1358675

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

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

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)

Cited In (13)

• New upper bounds for binary covering codes
• A combinatorial proof for the football pool problem for six matches
• Ternary Hamming and binary perfect covering codes
• Bounds for covering codes over large alphabets
• Constructing covering codes via automorphisms
• Title not available (Why is that?)
• Constructions, families, and tables of binary linear covering codes
• Further results on multiple coverings of the farthest-off points
• Upper bounds for football pool problems and mixed covering codes
• An updated table of binary/ternary mixed covering codes
• Graph domination, tabu search and the football pool problem
• Multiple coverings of the farthest-off points with small density from projective geometry
• Several new lower bounds for football pool systems

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)