Constructions and families of nonbinary linear codes with covering radius 2
DOI10.1109/18.771244zbMATH Open0957.94034OpenAlexW2124272067MaRDI QIDQ4701433FDOQ4701433
Authors: 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
Recommendations
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)
Cited In (13)
- New constructions of covering codes
- Constructing saturating sets in projective spaces using subgeometries
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
- New quaternary linear codes with covering radius 2
- On saturating sets in projective spaces.
- Constructions, families, and tables of binary linear covering codes
- Linear codes with covering radius 3
- On the minimum size of complete arcs and minimal saturating sets in projective planes
- Title not available (Why is that?)
- New bounds for linear codes of covering radii 2 and 3
- Linear codes with covering radius 2 and other new covering codes
- On saturating sets in small projective geometries
This page was built for publication: Constructions and families of nonbinary linear codes with covering radius 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701433)
