Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\)

DOI10.1016/j.ipl.2018.05.007zbMath1428.94115MaRDI QIDQ1653025

Y. Aharonov

Publication date: 17 July 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.05.007

zbMATH Keywords

covering radius; simplex codes; MacDonald codes; repetition codes

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

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

Uses Software

• Maple