✦ LIBER ✦

Generalization of Tanner's minimum distance bounds for LDPC codes

✍ Scribed by Min-Ho Shin; Joon-Sung Kim; Hong-Yeop Song

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized minimum distance iterative d

✍ Saejoon Kim 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 149 KB

Distance Bounds for an Ensemble of LDPC

✍ Sridharan, A.; Truhachev, D.; Lentmaier, M.; Costello, D.J.; Zigangirov, K.Sh. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 612 KB

Iterative Construction of Regular LDPC C

✍ Psota, E.; Pérez, L.C. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 288 KB

On minimum distance bounds for abelian c

✍ Roberta Evans Sabin 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 818 KB

Computing the Minimum Distance of Nonbin

✍ Lei Liu; Jie Huang; Wuyang Zhou; Shengli Zhou 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 161 KB

On the minimum distance of array codes a

✍ Kyeongcheol Yang; Helleseth, T. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 249 KB