On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance (Q5347250)
From MaRDI portal
scientific article; zbMATH DE number 6722493
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance |
scientific article; zbMATH DE number 6722493 |
Statements
On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance (English)
0 references
23 May 2017
0 references
covering radius
0 references
codes over finite rings
0 references
simplex code
0 references
MacDonald code
0 references
