A new table of binary/ternary mixed covering codes
From MaRDI portal
Publication:1358675
DOI10.1023/A:1008228721072zbMath0872.94056OpenAlexW1523264473MaRDI QIDQ1358675
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
Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (6)
Graph domination, tabu search and the football pool problem ⋮ Further results on multiple coverings of the farthest-off points ⋮ New upper bounds for binary covering codes ⋮ Multiple coverings of the farthest-off points with small density from projective geometry ⋮ An updated table of binary/ternary mixed covering codes ⋮ Bounds for covering codes over large alphabets
This page was built for publication: A new table of binary/ternary mixed covering codes
