Constructions and families of nonbinary linear codes with covering radius 2

DOI10.1109/18.771244zbMath0957.94034OpenAlexW2124272067MaRDI QIDQ4701433

Alexander A. Davydov

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.771244

zbMATH Keywords

covering radiuscovering codescomplete capslinear nonbinary codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (8)

Constructing saturating sets in projective spaces using subgeometries ⋮ On saturating sets in projective spaces. ⋮ On the minimum size of complete arcs and minimal saturating sets in projective planes ⋮ Linear codes with covering radius 3 ⋮ New quaternary linear codes with covering radius 2 ⋮ New bounds for linear codes of covering radii 2 and 3 ⋮ On saturating sets in small projective geometries ⋮ New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces

This page was built for publication: Constructions and families of nonbinary linear codes with covering radius 2