Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces
DOI10.1109/TIT.2005.859297zbMath1298.94153MaRDI QIDQ3546771
Alexander A. Davydov, Giorgio Faina, Fernanda Pambianco, Stefano Marcugini
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
covering radiuscovering densityCovering codesminimal saturating sets in projective geometrynonshortening covering codes
Projective techniques in algebraic geometry (14N05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (3)
This page was built for publication: Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces