Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (Q3546964): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:02, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard |
scientific article |
Statements
Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (English)
0 references
21 December 2008
0 references
