Some algorithms for computing the minimum distance of evaluation codes (Q3625892)
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: Some algorithms for computing the minimum distance of evaluation codes |
scientific article; zbMATH DE number 5556026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some algorithms for computing the minimum distance of evaluation codes |
scientific article; zbMATH DE number 5556026 |
Statements
22 May 2009
0 references
Linear codes
0 references
minimum distance
0 references
evaluation codes
0 references
Feng-Rao distance
0 references
codes from order domains
0 references
Apéry set
0 references
0.8496912717819214
0 references
0.8343064188957214
0 references
0.8211961388587952
0 references
0.8094885349273682
0 references
