On the Newton and covering radii of linear codes

DOI10.1109/18.796399MaRDI QIDQ4503452zbMATH OpenOpenAlexFDO

Authors Torleiv Kløve, E. M. Gabidulin

Publication date 7 September 2000

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

Full work available at URL https://semanticscholar.org/paper/25299bcc11cf191aedcd0cb34e880985118df57e

zbMATH Keywords

error correctioncovering radiusMDS codesNewton radius

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• The Generalized Covering Radii of Linear Codes
• New bounds for linear codes of covering radius 2
• Relations between the covering and Newton radii of binary codes
• A new approach to the covering radius of codes
• Bounds on the covering radius of linear codes
• Linear codes with covering radius 2 and other new covering codes
• 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 covering radius of codes
• scientific article; zbMATH DE number 4083543

Cited in

(6)

• On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes
• On the computation of coset leaders with high Hamming weight.
• New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
• A note on the Newton radius
• Relations between the covering and Newton radii of binary codes
• Partition-balanced families of codes and asymptotic enumeration in coding theory

This page was built for publication: On the Newton and covering radii of linear codes

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