✦ LIBER ✦

Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes

✍ Scribed by Kudekar, S.; Macris, N.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bootstrap decoding of low-density parity

✍ Nouh, A.; Banihashemi, A.H. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 248 KB

Low Complexity Decoder Architecture for

✍ Daesun Oh; Keshab K. Parhi 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 469 KB

Decoding low-density parity-check codes

✍ Yongyi Mao; Banihashemi, A.H. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 58 KB

Bounds on the maximum-likelihood decodin

✍ Miller, G.; Burshtein, D. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 557 KB

Augmented Belief-Propagation Decoding of

✍ Varnica, N.; Fossorier, M.; Kavcic, A. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 35 KB

Augmented Belief Propagation Decoding of

✍ Varnica, N.; Fossorier, M.P.C.; Kavcic, A. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 501 KB