Linear Codes With Covering Radius $2$ , $3$ and Saturating Sets in Projective Geometry
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco · IEEE Transactions on Information Theory · 2004
Infinite families of linear codes with covering radius R=2, 3 and codimension tR+1 are constructed on the base of starting codes with codimension 3 and 4. Parity-check matrices of the starting codes are treated as saturating sets in projective geometry that are obtained by computer search using projective properties of objects. Upper bounds on the length function and on the smallest sizes of saturating sets are given.