On codes with covering radius 1 and minimum distance 2

DOI10.1016/S0019-3577(01)80033-1zbMath1024.94020OpenAlexW2019286669MaRDI QIDQ1866450

J. H. van Lint, Sebastian Egner, Aart Blokhuis, Henk D. L. Hollmann

Publication date: 1 June 2003

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-3577(01)80033-1

zbMATH Keywords

covering radiusorthogonal arrayminimum distancebounds on the size of codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Orthogonal arrays, Latin squares, Room squares (05B15) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (2)

Jack van Lint (1932--2004): a survey of his scientific work ⋮ On mixed codes with covering radius 1 and minimum distance 2

Cites Work

• A Combinatorial Problem in Matching
• Coverings by rook domains
• On codes with given minimum distance and covering radius

This page was built for publication: On codes with covering radius 1 and minimum distance 2