Constructions and families of nonbinary linear codes with covering radius 2
From MaRDI portal
Publication:4701433
DOI10.1109/18.771244zbMath0957.94034MaRDI QIDQ4701433
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
94B05: Linear codes (general theory)
51E22: Linear codes and caps in Galois spaces
94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory
Related Items
On saturating sets in projective spaces., New quaternary linear codes with covering radius 2, On saturating sets in small projective geometries, Constructing saturating sets in projective spaces using subgeometries, Linear codes with covering radius 3, New bounds for linear codes of covering radii 2 and 3, New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces, On the minimum size of complete arcs and minimal saturating sets in projective planes