New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
From MaRDI portal
Publication:6646791
DOI10.3934/AMC.2023042MaRDI QIDQ6646791
Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
Publication date: 3 December 2024
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22) Blocking sets, ovals, (k)-arcs (51E21) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear nonbinary covering codes and saturating sets in projective spaces
- Galois geometries and coding theory
- Saturating sets in projective planes and hypergraph covers
- New bounds for linear codes of covering radius 2
- On the Lambert \(w\) function
- Higgledy-piggledy sets in projective spaces of small dimension
- Constructing saturating sets in projective spaces using subgeometries
- Transitive \(\mathrm{PSL}(2,7)\)-invariant 42-arcs in 3-dimensional projective spaces
- Linear codes with covering radius 3
- 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
- On defining sets for projective planes
- Construction of linear covering codes
- The geometry of covering codes: small complete caps and saturating sets in Galois spaces
- Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
- Fundamentals of Error-Correcting Codes
- Linear codes with covering radius R=2, 3 and codimension tR
- Constructions and families of covering codes and saturated sets of points in projective geometry
- Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
- Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
Related Items (1)
This page was built for publication: New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646791)