The geometry of covering codes: small complete caps and saturating sets in Galois spaces
From MaRDI portal
(Redirected from Publication:2875855)
Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Linear codes and caps in Galois spaces (51E22) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Research exposition (monographs, survey articles) pertaining to geometry (51-02)
Recommendations
- Linear nonbinary covering codes and saturating sets in projective spaces
- Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
- Constructions and families of covering codes and saturated sets of points in projective geometry
- A construction of small complete caps in projective spaces
- Galois geometries and coding theory
Cited in
(21)- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
- On the resilience of Even-Mansour to invariant permutations
- Saturating sets in projective planes and hypergraph covers
- On finite models of Hilbert's incidence geometry
- Further results on covering codes with radius R and codimension tR+1
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
- Maximum scattered linear sets and complete caps in Galois spaces
- Galois geometries and coding theory
- Further results on multiple coverings of the farthest-off points
- Complete caps in \(\mathrm{AG}(3, q)\) from elliptic curves
- Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture
- An asymptotic property of quaternary additive codes
- Galois geometries and coding theory
- New bounds for linear codes of covering radii 2 and 3
- Upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(N,q)\), \(N \geq 3\), under a certain probabilistic conjecture
- The third generalized covering radius for binary primitive double-error-correcting BCH codes
- Upper bounds on the length function for covering codes with covering radius R and codimension tR+1
- On near-MDS codes and caps
- Multiple coverings of the farthest-off points with small density from projective geometry
- Small complete caps in PG(4n+1,q)${\rm PG}(4n+1, q)$
This page was built for publication: The geometry of covering codes: small complete caps and saturating sets in Galois spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875855)
