On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance
From MaRDI portal
Publication:5347250
DOI10.1142/S1793830917500173zbMath1418.94089OpenAlexW2569187438MaRDI QIDQ5347250
Publication date: 23 May 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830917500173
Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Arithmetic codes (94B40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Codes and projective multisets
- Self-dual codes over the integers modulo 4
- New extremal type II codes over \(\mathbb{Z}_4\)
- Shadow codes over \({\mathbb Z}_4\)
- Covering radius---Survey and recent results
- Further results on the covering radius of codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Type II codes over Z/sub 4/
- On the covering radius of Z/sub 4/-codes and their lattices
This page was built for publication: On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance