New results on codes with covering radius 1 and minimum distance \(2\)

DOI10.1007/s10623-005-6404-3zbMath1081.94041MaRDI QIDQ1781002

Patric R. J. Östergård, Alfred Wassermann, Jörn Quistorff

Publication date: 15 June 2005

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

Full work available at URL: https://doi.org/10.1007/s10623-005-6404-3

zbMATH Keywords

covering radius; minimum distance; codes

Mathematics Subject Classification ID

94B65: Bounds on codes

51E22: Linear codes and caps in Galois spaces

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)

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

Related Items

On mixed codes with covering radius 1 and minimum distance 2, Jack van Lint (1932--2004): a survey of his scientific work, Search for combinatorial objects using lattice algorithms -- revisited

Uses Software

• nauty

Cites Work

• Attacking the market split problem with lattice point enumeration
• A new lower bound for the football pool problem for six matches
• Isomorph-Free Exhaustive Generation
• Bounds on mixed binary/ternary codes
• Classification of binary covering codes
• On the size of optimal binary codes of length 9 and covering radius 1
• The football pool problem for 5 matches
• A Combinatorial Problem in Matching
• Intersection Inequalities for the Covering Problem
• Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
• Covering problems for dichotomized matchings