New bounds for linear codes of covering radius 2

DOI10.1007/978-3-319-66278-7_1MaRDI QIDQ1705496zbMATH OpenOpenAlexFDO

Authors Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco

Publication date 16 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-66278-7_1

zbMATH Keywords

covering codeslength functionprojective spacessaturating setsupper bounds

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) 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 radii 2 and 3
• Linear codes with covering radius 3
• On the structure of linear codes with covering radius two and three
• New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
• New linear codes with covering radius 2 and odd basis

Cited in

(12)

• New linear codes with covering radius 2 and odd basis
• New results on codes with covering radius 1 and minimum distance 2
• Constructing saturating sets in projective spaces using subgeometries
• New bounds for linear codes of covering radii 2 and 3
• Some new upper bounds on the covering radius of binary linear codes
• On the structure of linear codes with covering radius two and three
• On the Newton and covering radii of linear codes
• Linear nonbinary covering codes and saturating sets in projective spaces
• Upper bounds on the length function for covering codes with covering radius R and codimension tR+1
• 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\)
• Cardinalities of g-difference sets

This page was built for publication: New bounds for linear codes of covering radius 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1705496)