Constructions and families of covering codes and saturated sets of points in projective geometry

DOI10.1109/18.476339MaRDI QIDQ4880341zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

covering codescovering radiusprojective geometriessaturated sets

Mathematics Subject Classification ID

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)

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

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
• 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 saturating sets in projective spaces.
• New quaternary linear codes with covering radius 2
• Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
• Resolution of a conjecture on the covering radius of linear codes
• Further results on multiple coverings of the farthest-off points
• Linear codes with covering radius 3
• 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
• On saturating sets in small projective geometries
• Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
• 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)