✦ LIBER ✦

New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel

✍ Scribed by Saeedi, H.; Banihashemi, A.H.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on achievable rates of LDPC codes

✍ Barak, O.; Burshtein, D.; Feder, M. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 286 KB

Capacity-achieving ensembles for the bin

✍ Pfister, H.D.; Sason, I.; Urbanke, R. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 763 KB

Efficient maximum-likelihood decoding of

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

Complexity versus performance of capacit

✍ Sason, I.; Urbanke, R. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 404 KB

Successive Maximization for Systematic D

✍ Saeedi, H.; Pishro-Nik, H.; Banihashemi, A.H. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 463 KB

On the performance of turbo codes over t

✍ Lee, J.W.; Urbanke, R.; Blahut, R.E. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 179 KB