Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (Q3546964): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q293456 |
Changed an Item |
||
| Property / author | |||
| Property / author: Venkatesan Guruswami / rank | |||
Normal rank | |||
Revision as of 19:33, 12 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
