On saturating sets in small projective geometries
From MaRDI portal
Publication:1580668
DOI10.1006/eujc.1999.0373zbMath0971.51004MaRDI QIDQ1580668
Alexander A. Davydov, Patric R. J. Östergård
Publication date: 28 October 2001
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/143f8878efc1438105cb80f3203940c63c00222f
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
51E20: Combinatorial structures in finite projective spaces
94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory
Related Items
Galois geometries and coding theory, On saturating sets in projective spaces., Linear codes with covering radius 3, Minimal 1-saturating sets and complete caps in binary projective spaces., Bounds for covering codes over large alphabets
Cites Work
- On the completeness of certain plane arcs. II
- New examples of complete k-arcs in PG(2,q)
- Some optimal codes from algebraic geometry and their covering radii
- Small complete arcs in Galois planes
- Saturated configurations of points in projective Galois spaces
- New linear codes with covering radius 2 and odd basis
- Ternary covering codes derived from BCH codes
- New quaternary linear codes with covering radius 2
- Computer search for small complete caps
- Small complete caps in spaces of even characteristic
- Linear codes with covering radius 2 and other new covering codes
- On the covering radius of codes
- Short codes with a given covering radius
- Constructions, families, and tables of binary linear covering codes
- Covering radii of ternary linear codes of small dimensions and codimensions
- Constructions and families of nonbinary linear codes with covering radius 2
- Constructions and families of covering codes and saturated sets of points in projective geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
