✦ LIBER ✦

Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes

✍ Scribed by Kiayias, A.; Yung, M.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On decoding of Reed-Solomon codes

✍ Mandelbaum, D. 📂 Article 📅 1971 🏛 IEEE 🌐 English ⚖ 870 KB

Efficient soft decoding of reed-solomon

✍ Shayegh, F.; Soleymani, M.R. 📂 Article 📅 2011 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 991 KB

Parallel Decoding of the Reed–Solomon Co

✍ E.G. Sukhov 📂 Article 📅 2001 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 121 KB

Maximum-likelihood decoding of Reed-Solo

✍ Guruswami, V.; Vardy, A. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 276 KB

On the complexity of decoding Reed-Solom

✍ Justesen, J. 📂 Article 📅 1976 🏛 IEEE 🌐 English ⚖ 336 KB

Bounds on the List-Decoding Radius of Re

✍ Ruckenstein, Gitit; Roth, Ron M. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 287 KB