On covering radius of codes over R=Z₂+uZ₂, where u^2=0 using Chinese Euclidean distance
DOI10.1142/S1793830917500173zbMATH Open1418.94089OpenAlexW2569187438MaRDI QIDQ5347250FDOQ5347250
Authors: P. Chella Pandian 
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
Recommendations
- Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\)
- Covering radius of codes over the ring \(F_2+uF_2\)
- On the covering radius of some modular codes
- On covering radius of codes over \(\mathbb{Z}_{2p}\)
- On codes over \(\mathbb Z_{p^2}\) and its covering radius
Arithmetic codes (94B40) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cites Work
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Type II codes over Z/sub 4/
- Shadow codes over \({\mathbb Z}_4\)
- Codes and projective multisets
- Further results on the covering radius of codes
- Covering radius---Survey and recent results
- Self-dual codes over the integers modulo 4
- New extremal type II codes over \(\mathbb{Z}_4\)
- Title not available (Why is that?)
- On the covering radius of Z/sub 4/-codes and their lattices
- Title not available (Why is that?)
Cited In (7)
- On some classes of block repetition codes with covering radius of the codes \(\mathbb{Z}_{3^2}\)
- Covering radius of linear codes over ring \(F_q+uF_q+u^2F_q+\cdots +u^{k-1}F_q\)
- Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\)
- On covering radius of codes over \(\mathbb{Z}_{2p}\)
- On the covering radius of some modular codes
- On codes over \(\mathbb Z_{p^2}\) and its covering radius
- Covering radius of codes over the ring \(F_2+uF_2\)
This page was built for publication: On covering radius of codes over \(R=\mathbb{Z}_2+u\mathbb{Z}_2\), where \(u^2=0\) using Chinese Euclidean distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347250)
