Linear codes with covering radius 3
From MaRDI portal
Publication:2267791
DOI10.1007/s10623-009-9322-yzbMath1189.94061MaRDI QIDQ2267791
Patric R. J. Östergård, Alexander A. Davydov
Publication date: 2 March 2010
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-009-9322-y
94B05: Linear codes (general theory)
94B65: Bounds on codes
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
Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\), 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New linear codes with covering radius 2 and odd basis
- The packing problem in statistics, coding theory and finite projective spaces
- Ternary covering codes derived from BCH codes
- New quaternary linear codes with covering radius 2
- On saturating sets in small projective geometries
- Classifying subspaces of Hamming spaces
- Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces
- Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
- Short codes with a given covering radius
- Covering radii of ternary linear codes of small dimensions and codimensions
- Linear codes with covering radius R=2, 3 and codimension tR
- Constructions and families of nonbinary linear codes with covering radius 2
- Constructions and families of covering codes and saturated sets of points in projective geometry
