Searching for "Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
by Venkatesan Guruswami, Alexander Vardy — 2005 — IEEE Transactions on Information Theory
…Maximum-Likelihood Decoding of Reed-Solomon Codes is NP-hard Venkatesan Guruswami Department…
Cited by 16 (2 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB