On covering radius of codes over Z₂p
From MaRDI portal
Publication:5221001
Recommendations
- On codes over \(\mathbb Z_{p^2}\) and its covering radius
- On the covering radius of some modular codes
- On covering radius of codes over \(R=\mathbb{Z}_2+u\mathbb{Z}_2\), where \(u^2=0\) using Chinese Euclidean distance
- Covering radius of codes over the ring \(F_2+uF_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\)
Cites work
- Covering radius---Survey and recent results
- Double circulant self-dual codes over Z/sub 2k/
- New extremal type II codes over \(\mathbb{Z}_4\)
- On codes over \(\mathbb Z_{p^2}\) and its covering radius
- On the covering radius of Z/sub 4/-codes and their lattices
- On the covering radius of some modular codes
- 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/
- Type II self-dual codes over finite rings and even unimodular lattices
Cited in
(10)- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- On some classes of block repetition codes with covering radius of the codes \(\mathbb{Z}_{3^2}\)
- The covering radius of extreme binary 2-surjective codes
- On the covering radius of Z/sub 4/-codes and their lattices
- 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 \(R=\mathbb{Z}_2+u\mathbb{Z}_2\), where \(u^2=0\) using Chinese Euclidean distance
- On the covering radius of some modular codes
- On codes over \(\mathbb Z_{p^2}\) and its covering radius
- On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
- Covering radius of codes over the ring \(F_2+uF_2\)
This page was built for publication: On covering radius of codes over \(\mathbb{Z}_{2p}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221001)