NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem (Q4581908)
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: NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem |
scientific article; zbMATH DE number 6921487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8479618430137634
0 references
0.8458269834518433
0 references
0.823028028011322
0 references
0.8169827461242676
0 references
0.7886688113212585
0 references
