Constructions and families of covering codes and saturated sets of points in projective geometry
DOI10.1109/18.476339zbMATH Open0845.94022OpenAlexW2079279879MaRDI QIDQ4880341FDOQ4880341
Authors: Alexander A. Davydov 
Publication date: 15 September 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.476339
Recommendations
- Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
- Linear nonbinary covering codes and saturating sets in projective spaces
- Constructions and families of nonbinary linear codes with covering radius 2
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- Linear codes with covering radius 3
Combinatorial aspects of finite geometries (05B25) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cited In (22)
- Projective planes, coverings and a network problem
- On the resilience of Even-Mansour to invariant permutations
- Linear nonbinary covering codes and saturating sets in projective spaces
- On covering sets for limited-magnitude errors
- New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
- 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.
- Resolution of a conjecture on the covering radius of linear codes
- Linear codes with covering radius 3
- Further results on multiple coverings of the farthest-off points
- Saturating systems and the rank-metric covering radius
- On the minimum size of complete arcs and minimal saturating sets in projective planes
- Galois geometries and coding theory
- The geometry of covering codes: small complete caps and saturating sets in Galois spaces
- Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces
- Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
- On saturating sets in small projective geometries
- Multiple coverings of the farthest-off points with small density from projective geometry
- Ternary covering codes derived from BCH codes
This page was built for publication: Constructions and families of covering codes and saturated sets of points in projective geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880341)
