NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908)
From MaRDI portal
scientific article; zbMATH DE number 6921487
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem |
scientific article; zbMATH DE number 6921487 |
Statements
NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (English)
0 references
21 August 2018
0 references
Reed-Solomon decdoing
0 references
polynomial reconstruction
0 references
Prouhet-Tarry-Escott problem
0 references
bounded distance decoding
0 references
0 references
