Linear codes with covering radius R=2, 3 and codimension tR

1 January 2001

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 47 (1) , 416-421
https://doi.org/10.1109/18.904551

Abstract

Let [n,n-r]/sub q/R denote a linear code over F/sub q/ with length n, codimension r, and covering radius R. We use a modification of constructions of [2q+1, 2q-3]/sub q/2 and [3q+1, 3q-5]/sub q/3 codes (q/spl ges/5) to produce infinite families of good codes with covering radius 2 and 3 and codimension tR.

Keywords

LINEAR CODES

This publication has 8 references indexed in Scilit:

On Saturating Sets in Small Projective Geometries
European Journal of Combinatorics, 2000
New Quaternary Linear Codes with Covering Radius 2
Finite Fields and Their Applications, 2000
Constructions and families of nonbinary linear codes with covering radius 2
IEEE Transactions on Information Theory, 1999
Correction to "Covering Radii Of Ternary Linear Codes Of Small Dimensions And Codimensions"
IEEE Transactions on Information Theory, 1998
Projective Geometries over Finite Fields
Published by Oxford University Press (OUP) ,1998
Covering radii of ternary linear codes of small dimensions and codimensions
IEEE Transactions on Information Theory, 1997
Constructions and families of covering codes and saturated sets of points in projective geometry
IEEE Transactions on Information Theory, 1995
Short codes with a given covering radius
IEEE Transactions on Information Theory, 1989