✦ LIBER ✦

Maximum-likelihood decoding of Reed-Solomon codes is NP-hard

✍ Scribed by Guruswami, V.; Vardy, A.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Towards Maximum Likelihood Soft Decision

✍ Jin Wenyi; Fossorier, M. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 311 KB

Maximum likelihood decoding of certain R

✍ Seroussi, G.; Lempel, A. 📂 Article 📅 1983 🏛 IEEE 🌐 English ⚖ 528 KB

Cryptographic Hardness Based on the Deco

✍ Kiayias, A.; Yung, M. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 508 KB

Simple maximum-likelihood decoding of ge

✍ Schmidt, K.-U.; Finger, A. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 170 KB

Performance of Adaptive Belief Propagati

✍ Todd, R.M.; Cruz, J.R. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 162 KB

Performance of Reed-Muller codes and a m

✍ Jones, A.E.; Wilkinson, T.A. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 109 KB