Linear codes with covering radius R=2, 3 and codimension tR
From MaRDI portal
Publication:4544488
DOI10.1109/18.904551zbMATH Open0997.94039OpenAlexW2073553414MaRDI QIDQ4544488FDOQ4544488
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
Recommendations
Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cited In (13)
- 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\)
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- On saturating sets in projective spaces.
- On the structure of linear codes with covering radius two and three
- Linear codes with covering radius 3
- Title not available (Why is that?)
- The number of inequivalent \((2R+3,7)R\) optimal covering codes
- Title not available (Why is that?)
- New bounds for linear codes of covering radii 2 and 3
- Linear codes with covering radius 2 and other new covering codes
- Linear codes from planar functions and related covering codes
- Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
This page was built for publication: Linear codes with covering radius R=2, 3 and codimension tR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544488)
