New bounds for linear codes of covering radii 2 and 3

DOI10.1007/S12095-018-0335-0MaRDI QIDQ2325293zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

covering codessaturating setsprojective spaceslength functionUpper bounds

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1284415 (Why is no real title available?)
• scientific article; zbMATH DE number 1284421 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• scientific article; zbMATH DE number 1795248 (Why is no real title available?)
• A note on a geometric construction of large Cayley graphs of given degree and diameter
• Applications of finite geometry in coding theory and cryptography
• Constructions and families of nonbinary linear codes with covering radius 2
• Galois geometries and coding theory
• Galois geometries and coding theory
• Greedy codes
• Linear codes with covering radius 3
• Linear codes with covering radius R=2, 3 and codimension tR
• Linear nonbinary covering codes and saturating sets in projective spaces
• New bounds for linear codes of covering radius 2
• On saturating sets in projective spaces.
• Saturated configurations of points in projective Galois spaces
• Saturating sets in projective planes and hypergraph covers
• The Magma algebra system. I: The user language
• The geometry of covering codes: small complete caps and saturating sets in Galois spaces
• The packing problem in statistics, coding theory and finite projective spaces
• Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search

Cited in

(14)

• On the Newton and covering radii of linear codes
• Constructing saturating sets in projective spaces using subgeometries
• 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\)
• 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
• Cardinalities of g-difference sets
• scientific article; zbMATH DE number 2088006 (Why is no real title available?)

Describes a project that uses

Uses Software

• Magma

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)