✦ LIBER ✦

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

✍ Scribed by Pfister, H.D.; Sason, I.; Urbanke, R.

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

Capacity-achieving sequences for the era

✍ Oswald, P.; Shokrollahi, A. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 978 KB

Complexity versus performance of capacit

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

Bounds on the Number of Iterations for T

✍ Sason, I.; Wiechman, G. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 380 KB

Improved computational bound for the bin

✍ Epstein, M. 📂 Article 📅 1963 🏛 IEEE 🌐 English ⚖ 165 KB

Bounds on achievable rates of LDPC codes

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