Relations between the covering and Newton radii of binary codes

DOI10.1016/S0012-365X(00)00412-XMaRDI QIDQ5943887zbMATH OpenOpenAlexWikidataFDO

Authors Torleiv Kløve

Publication date 6 March 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(00)00412-x

zbMATH Keywords

binary codescovering radiuserror correctionNewton radius

Mathematics Subject Classification ID

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

Recommendations

• On the Newton and covering radii of linear codes
• A note on the Newton radius
• The Newton radius of codes
• A new approach to the covering radius of codes
• On the covering radius of codes

Cited in

(4)

• On the computation of coset leaders with high Hamming weight.
• The Newton radius of codes
• A note on the Newton radius
• On the Newton and covering radii of linear codes

This page was built for publication: Relations between the covering and Newton radii of binary codes

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