Login / Signup

On the NP-hardness of bounded distance decoding of Reed-Solomon codes.

Venkata GandikotaBadih GhaziElena Grigorescu
Published in: ISIT (2015)
Keyphrases
  • np hardness
  • reed solomon codes
  • np hard
  • approximation algorithms
  • turbo codes
  • mixed integer
  • error resilient
  • error resilience
  • optimal solution
  • special case