Linear Codes With Covering Radius<tex>2</tex>,<tex>3</tex>and Saturating Sets in Projective Geometry
From MaRDI portal
Publication:3546772
Recommendations
- Linear codes with covering radius 3
- Constructions and families of covering codes and saturated sets of points in projective geometry
- Constructions and families of nonbinary linear codes with covering radius 2
- Linear nonbinary covering codes and saturating sets in projective spaces
- Linear codes with covering radius 2 and other new covering codes
Cited in
(12)- Linear nonbinary covering codes and saturating sets in projective spaces
- Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry
- 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
- New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
- On the structure of linear codes with covering radius two and three
- Linear codes with covering radius 3
- Saturating linear sets of minimal rank
- The geometry of covering codes: small complete caps and saturating sets in Galois spaces
- Linear codes with covering radius 2 and other new covering codes
- Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces
- On saturating sets in small projective geometries
This page was built for publication: Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546772)
