Constructions and families of nonbinary linear codes with covering radius 2

No abstract is available for this paper.

• Publication year

  1999

• Venue

  IEEE Transactions on Information Theory

• Publication date

  1999-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/18.771244
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• New Constructions for q-ary Covering Codes

  1999cited by this paper
• The packing problem in statistics, coding theory and finite projective spaces

  1998cited by this paper
• Ternary Covering Codes Derived from BCH Codes

  1997cited by this paper
• Small Complete Caps in Spaces of Even Characteristic

  1996cited by this paper
• Constructions and families of covering codes and saturated sets of points in projective geometry

  1995cited by this paper
• Constructions, families, and tables of binary linear covering codes

  1994cited by this paper
• Constructions of Codes with Covering Radius 2

  1991cited by this paper
• Some Optimal Codes from Algebraic Geometry and Their Covering Radii

  1990cited by this paper
• Short codes with a given coveting radius

  1989influential reference
• Saturated Configurations of Points in Projective Galois Spaces

  1987cited by this paper
• Surveys in Combinatorics: MAXIMUM SETS IN FINITE PROJECTIVE SPACES

  1983cited by this paper
• Projective Geometries Over Finite Fields

  1980cited by this paper

• Steiner triple systems and spreading sets in projective spaces

  2021cites this paper
• Constructing saturating sets in projective spaces using subgeometries

  2020cites this paper
• New covering codes of radius R , codimension tR and tR + R 2 , and saturating sets in projective spaces

  2019cites this paper
• New bounds for linear codes of covering radii 2 and 3

  2018cites this paper
• New covering codes of radius R, codimension tR and $$tR+\frac{R}{2}$$tR+R2, and saturating sets in projective spaces

  2018cites this paper
• New Bounds for Linear Codes of Covering Radius 2

  2017cites this paper
• Upper bounds on the smallest size of a saturating set in projective planes and spaces of even dimension

  2017influential citation
• On upper bounds on the smallest size of a saturating set in a projective plane

  2015influential citation
• On upper bounds on the smallest size of a saturating set in a projective plane

  2015influential citation
• On the minimum size of complete arcs and minimal saturating sets in projective planes

  2013cites this paper
• On the minimum size of complete arcs and minimal saturating sets in projective planes

  2013cites this paper
• Classification of minimal 1-saturating sets in $PG(2,q)$, $q\leq 23$

  2012cites this paper
• Linear codes with covering radius 3

  2010cites this paper
• Linear nonbinary covering codes and saturating sets in projective spaces

  2009influential citation
• Linear covering codes over nonbinary finite fields

  2008cites this paper
• Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions

  2007influential citation
• On Small Dense Sets in Galois Planes

  2007cites this paper
• Quasi-Perfect Linear Codes With Minimum Distance $4$

  2007cites this paper
• Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces

  2005cites this paper
• Linear codes with covering radius 2, 3 and saturating sets in projective geometry

  2004influential citation
• Binary Two-Error-Correcting Codes are Better than Quaternary

  2003cites this paper
• On saturating sets in projective spaces

  2003cites this paper
• Minimal 1-saturating sets in PG(2, q), q≤16

  2003cites this paper
• Linear Codes with Covering Radius and Codimension

  2001cites this paper
• Linear codes with covering radius R = 2, 3 and codimension tR

  2001cites this paper
• New Quaternary Linear Codes with Covering Radius

  2000cites this paper
• On Saturating Sets in Small Projective Geometries

  2000cites this paper
• New Quaternary Linear Codes with Covering Radius 2

  2000cites this paper
• New Linear Codes with Covering Radius 2 and Odd Basis

  1999cites this paper