collaborators

1 paper

cs.IT2005

On Deciding Deep Holes of Reed-Solomon Codes

Qi Cheng, Elizabeth Murray

For generalized Reed-Solomon codes, it has been proved \cite{GuruswamiVa05} that the problem of determining if a received word is a deep hole is co-NP-complete. The reduction relie…