Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\) (Q1653025)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\) |
scientific article; zbMATH DE number 6904562
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\) |
scientific article; zbMATH DE number 6904562 |
Statements
Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\) (English)
0 references
17 July 2018
0 references
covering radius
0 references
repetition codes
0 references
simplex codes
0 references
MacDonald codes
0 references
0 references
