On the Newton and covering radii of linear codes
From MaRDI portal
Publication:4503452
DOI10.1109/18.796399zbMath0960.94043OpenAlexW2146124250MaRDI QIDQ4503452
Torleiv Kløve, Ernst 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
Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (4)
A note on the Newton radius ⋮ On the computation of coset leaders with high Hamming weight. ⋮ On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering 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
