Hardness of approximating the minimum distance of a linear code (Q4679877)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2172484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of approximating the minimum distance of a linear code |
scientific article; zbMATH DE number 2172484 |
Statements
Hardness of approximating the minimum distance of a linear code (English)
0 references
31 May 2005
0 references
0.8800986409187317
0 references
0.879195511341095
0 references
0.8545742034912109
0 references
0.8332556486129761
0 references
0.8332555890083313
0 references
