NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem.
Venkata GandikotaBadih GhaziElena GrigorescuPublished in: Electron. Colloquium Comput. Complex. (2016)
Keyphrases
- reed solomon
- np hardness
- error correction
- np hard
- error control
- approximation algorithms
- distributed video coding
- mixed integer
- turbo codes
- unequal error protection
- optimal solution
- transform domain
- channel coding
- lower bound
- error detection
- special case
- image transmission
- video transmission
- worst case
- wireless sensor networks