Linear codes with covering radius R=2, 3 and codimension tR

DOI10.1109/18.904551zbMath0997.94039OpenAlexW2073553414MaRDI QIDQ4544488

Patric R. J. Östergård, Alexander A. Davydov

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.904551

zbMATH Keywords

bounds on codeslengtheningcovering code

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (5)

On saturating sets in projective spaces. ⋮ Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\) ⋮ 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

This page was built for publication: Linear codes with covering radius R=2, 3 and codimension tR