Linear codes with covering radius 3
A linear code in \(\mathbb{F}_q^n\) with codimension \(r\), minimum distance \(d\), and covering radius \(R\) is said to be an \textit{\([n,n-r,d]_qR\)-code}. In particular, the fact that the covering radius of the linear code is equal to \(R\) means that all vectors of \(\mathbb{F}_q^r\) can be obtained as a linear combination of at most \(R\) columns of a parity check matrix of this \([n,n-r,d]_qR\)-code. The minimum length \(n\) for which an \([n,n-r,d]_qR\)-code exists, is called the \textit{length function} and is denoted by \(\ell_q(r,R)\). Let PG\((v,q)\) denote the \(v\)-dimensional projective space over the finite field \(\mathbb{F}_q\) of order \(q\). A set of points \(S\subset\) PG\((v,q)\) is said to be \textit{\(\rho\)-saturating} if for any point \(x\) of PG\((v,q)\), there exist \(\rho+1\) points in \(S\) generating a subspace of PG\((v,q)\) containing \(x\), and \(\rho\) is the smallest integer for which this property holds. The authors derive in this article new upper bounds on the parameters \(\ell_q(r,3)\) for \(q\geq 3\), i.e., they derive new upper bounds on the smallest size of 2-saturating sets in PG\((r-1,q)\). To obtain these new upper bounds, they describe a general construction, denoted by \textit{Construction A}. They then give six particular instances of this general Construction A, denoted by \textit{Constructions A1 to A6}, leading to new infinite families of codes having covering radius 3. Additionally, a table giving upper bounds on \(\ell_q(4,3)\) for \(q\leq 563\), a table giving upper bounds on \(\ell_q(5,3)\) for \(q\leq 43\), and two tables with upper bounds on \(\ell_q(r,3)\) for \(q=3,4,5,7\), and \(r\leq 24\) are given.
- On the structure of linear codes with covering radius two and three
- Linear codes with covering radius R=2, 3 and codimension tR
- New bounds for linear codes of covering radii 2 and 3
- Covering radii of ternary linear codes of small dimensions and codimensions
- scientific article; zbMATH DE number 1188977
- Linear codes with covering radius 2 and other new covering codes
- Bounds on the covering radius of linear codes
- The Generalized Covering Radii of Linear Codes
- Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
- On the Covering Dimension of a Linear Code
- Classifying subspaces of Hamming spaces
- Constructions and families of covering codes and saturated sets of points in projective geometry
- Constructions and families of nonbinary linear codes with covering radius 2
- Covering radii of ternary linear codes of small dimensions and codimensions
- scientific article; zbMATH DE number 3823809 (Why is no real title available?)
- scientific article; zbMATH DE number 1284421 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- Linear codes with covering radius R=2, 3 and codimension tR
- Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
- Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces
- New linear codes with covering radius 2 and odd basis
- New quaternary linear codes with covering radius 2
- On saturating sets in small projective geometries
- Short codes with a given covering radius
- Ternary covering codes derived from BCH codes
- The packing problem in statistics, coding theory and finite projective spaces
- Graphs associated with codes of covering radius 1 and minimum distance 2
- New linear codes with covering radius 2 and odd basis
- New bounds for linear codes of covering radius 2
- The covering radius of \(\mathrm{PGL}(3, q)\)
- New bounds for linear codes of covering radii 2 and 3
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- scientific article; zbMATH DE number 4160649 (Why is no real title available?)
- Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
- Cyclotomic Linear Codes of Order 3
- Short codes with a given covering radius
- On the structure of linear codes with covering radius two and three
- scientific article; zbMATH DE number 729918 (Why is no real title available?)
- Covering radii of ternary linear codes of small dimensions and codimensions
- Linear codes with covering radius R=2, 3 and codimension tR
- On the least covering radius of binary linear codes with small lengths
- scientific article; zbMATH DE number 2096443 (Why is no real title available?)
- Constructions and families of covering codes and saturated sets of points in projective geometry
- Linear nonbinary covering codes and saturating sets in projective spaces
- Upper bounds on the length function for covering codes with covering radius R and codimension tR+1
- Further results on covering codes with radius R and codimension tR+1
- Resolution of a conjecture on the covering radius of linear codes
- New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
- Linear codes from planar functions and related covering codes
This page was built for publication: Linear codes with covering radius 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267791)