✦ LIBER ✦

Bounds on achievable rates of LDPC codes used over the binary erasure channel

✍ Scribed by Barak, O.; Burshtein, D.; Feder, M.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Sequences of Capacity Achieving LDPC

✍ Saeedi, H.; Banihashemi, A.H. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 413 KB

Efficient maximum-likelihood decoding of

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

On Achievable Rates and Complexity of LD

✍ Igal Sason; Gil Wiechman 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 585 KB

Bounds on Rates of LDPC Codes for BEC wi

✍ Barak, O.; Erez, U.; Burshtein, D. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 497 KB

On the performance of turbo codes over t

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

On Design of Rateless Codes over Dying B

✍ Meng Zeng; Calderbank, R.; Shuguang Cui 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 161 KB