New bounds for linear codes of covering radii 2 and 3
DOI10.1007/s12095-018-0335-0zbMath1419.94092OpenAlexW2903421962MaRDI QIDQ2325293
Stefano Marcugini, Daniele Bartoli, 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
Linear codes (general theory) (94B05) Bounds on codes (94B65) 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)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
- Linear nonbinary covering codes and saturating sets in projective spaces
- Greedy codes
- Galois geometries and coding theory
- Saturated configurations of points in projective Galois spaces
- The packing problem in statistics, coding theory and finite projective spaces
- The Magma algebra system. I: The user language
- On saturating sets in projective spaces.
- Saturating sets in projective planes and hypergraph covers
- New bounds for linear codes of covering radius 2
- Linear codes with covering radius 3
- The geometry of covering codes: small complete caps and saturating sets in Galois spaces
- Applications of finite geometry in coding theory and cryptography
- Linear codes with covering radius R=2, 3 and codimension tR
- Constructions and families of nonbinary linear codes with covering radius 2
This page was built for publication: New bounds for linear codes of covering radii 2 and 3