On covering radius of codes over R=Z₂+uZ₂, where u^2=0 using Chinese Euclidean distance

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

Cites work

scientific article; zbMATH DE number 2081128 (Why is no real title available?)
scientific article; zbMATH DE number 1504662 (Why is no real title available?)
Codes and projective multisets
Covering radius---Survey and recent results
Further results on the covering radius of codes
New extremal type II codes over \(\mathbb{Z}_4\)
On the covering radius of Z/sub 4/-codes and their lattices
Self-dual codes over the integers modulo 4
Shadow codes over \({\mathbb Z}_4\)
The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
Type II codes over Z/sub 4/

Cited in

(7)

On some classes of block repetition codes with covering radius of the codes \(\mathbb{Z}_{3^2}\)
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 linear codes over ring \(F_q+uF_q+u^2F_q+\cdots +u^{k-1}F_q\)
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
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)