Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (Q3546964): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Venkatesan Guruswami / rank | |||
Property / author | |||
Property / author: Venkatesan Guruswami / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: cs/0405005 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:28, 19 April 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