Maximum-likelihood decoding of Reed-Solomon codes is NP-hard (Q2921702)
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: Maximum-likelihood decoding of Reed-Solomon codes is NP-hard |
scientific article; zbMATH DE number 6354859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum-likelihood decoding of Reed-Solomon codes is NP-hard |
scientific article; zbMATH DE number 6354859 |
Statements
13 October 2014
0 references
0.98716056
0 references
0.91689056
0 references
0.90635264
0 references
0.8857381
0 references
0.8847542
0 references
0.8818072
0 references
0 references
0 references
0.8739749
0 references
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard (English)
0 references
