New bounds for linear codes of covering radii 2 and 3
DOI10.1007/S12095-018-0335-0zbMATH Open1419.94092OpenAlexW2903421962MaRDI QIDQ2325293FDOQ2325293
Authors: Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco, Alexander A. Davydov, Massimo Giulietti 
Publication date: 25 September 2019
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-018-0335-0
Recommendations
- New bounds for linear codes of covering radius 2
- Linear codes with covering radius 3
- Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
- New linear codes with covering radius 2 and odd basis
- On the structure of linear codes with covering radius two and three
Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05) Bounds on codes (94B65) Linear codes and caps in Galois spaces (51E22) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Saturated configurations of points in projective Galois spaces
- The packing problem in statistics, coding theory and finite projective spaces
- On saturating sets in projective spaces.
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
- The geometry of covering codes: small complete caps and saturating sets in Galois spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear nonbinary covering codes and saturating sets in projective spaces
- Title not available (Why is that?)
- Galois geometries and coding theory
- Title not available (Why is that?)
- Galois geometries and coding theory
- Applications of finite geometry in coding theory and cryptography
- Greedy codes
- Saturating sets in projective planes and hypergraph covers
- Linear codes with covering radius R=2, 3 and codimension tR
- Constructions and families of nonbinary linear codes with covering radius 2
- A note on a geometric construction of large Cayley graphs of given degree and diameter
- New bounds for linear codes of covering radius 2
- Linear codes with covering radius 3
Cited In (13)
- On the Newton and covering radii of linear codes
- Further results on covering codes with radius \(R\) and codimension \(tR+1\)
- New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
- Constructing saturating sets in projective spaces using subgeometries
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- Some new upper bounds on the covering radius of binary linear codes
- On the structure of linear codes with covering radius two and three
- Linear codes with covering radius 3
- An improved sphere covering bound for the codes with n=3R+2
- Linear inequalities for covering codes. II. Triple covering inequalities
- Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
- New bounds for linear codes of covering radius 2
- Title not available (Why is that?)
Uses Software
This page was built for publication: New bounds for linear codes of covering radii 2 and 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2325293)
