The hardness of decoding linear codes with preprocessing (Q3484767)
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: The hardness of decoding linear codes with preprocessing |
scientific article; zbMATH DE number 4156366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The hardness of decoding linear codes with preprocessing |
scientific article; zbMATH DE number 4156366 |
Statements
The hardness of decoding linear codes with preprocessing (English)
0 references
1990
0 references
maximum likelihood decoding of linear block codes
0 references
polynomial time algorithm
0 references
complexity theory
0 references
0.872859537601471
0 references
0.8574280142784119
0 references
0.8102056384086609
0 references
0.8096442818641663
0 references
