On codes with given minimum distance and covering radius

zbMath0981.94065MaRDI QIDQ5948433

Jörn Quistorff

Publication date: 18 November 2001

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/228842

zbMATH Keywords

lower boundcovering codesnonlinear codeserror-correcting codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

Further results on multiple coverings of the farthest-off points ⋮ On maximal partial Latin hypercubes ⋮ On mixed codes with covering radius 1 and minimum distance 2 ⋮ Multiple coverings of the farthest-off points with small density from projective geometry ⋮ On codes with covering radius 1 and minimum distance 2

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