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.94115OpenAlexW2806230497MaRDI 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 radiussimplex codesMacDonald codesrepetition codes

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)

Related Items (1)

Some results on \(\mathbb{F}_4[v\)-double cyclic codes]

Uses Software

• Maple

Cites Work

• Secret Sharing Schemes from Linear Codes overFp + vFp
• Optimal Self-Dual Codes Over>tex<$ BBF _2times BBF _2$>/tex<With Respect to the Hamming Weight
• Covering radius---Survey and recent results
• On the covering radius of Z/sub 4/-codes and their lattices
• Some Results on Cyclic Codes Over ${F}_{2}+v{F}_{2}$
• On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\)