✦ LIBER ✦

Capacity-Achieving Codes With Bounded Graphical Complexity and Maximum Likelihood Decoding

✍ Scribed by Chun-Hao Hsu; Anastasopoulos, A.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Capacity-achieving codes for finite-stat

✍ Jung Bae; Anastasopoulos, A. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 367 KB

Extending the Dorsch decoder towards ach

✍ Tomlinson, M.; Tjhai, C.; Ambroze, M. 📂 Article 📅 2007 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 383 KB

Universally optimum block codes and conv

✍ Hashimoto, T.; Arimoto, S. 📂 Article 📅 1980 🏛 IEEE 🌐 English ⚖ 826 KB

On Union Bounds for Random Serially Conc

✍ Sason, Igal ;Shamai, Shlomo 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 1001 KB

Product accumulate codes: a class of cod

✍ Jing Li; Narayanan, K.R.; Georghiades, C.N. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 533 KB

Performance evaluation of maximum-likeli

✍ Yousefi, S. 📂 Article 📅 2006 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 302 KB