Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces

DOI10.1109/TIT.2005.859297MaRDI QIDQ3546771zbMATH OpenFDO

Authors Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

covering densitycovering radiusCovering codesminimal saturating sets in projective geometrynonshortening covering codes

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Projective techniques in algebraic geometry (14N05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Linear nonbinary covering codes and saturating sets in projective spaces
• Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
• Constructions and families of covering codes and saturated sets of points in projective geometry
• Further results on multiple coverings of the farthest-off points
• New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces

Cited in

(3)

• On the minimum size of complete arcs and minimal saturating sets in projective planes
• Linear codes with covering radius 3
• New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces

This page was built for publication: Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546771)