✦ LIBER ✦

Upper bounds on the rate of LDPC codes as a function of minimum distance

✍ Scribed by Ben-Haim, Y.; Litsyn, S.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds on the rate of LDPC codes

✍ Burshtein, D.; Krivelevich, M.; Litsyn, S.; Miller, G. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 455 KB

On the minimum distance of array codes a

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

Upper bounds on the minimum distance of

✍ Boyvalenkov, P.G.; Danev, D.P.; Bumova, S.P. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 591 KB

Asymptotic Upper Bounds on the Minimum D

✍ Calderbank, A.; Mazo, J.; Wei, V. 📂 Article 📅 1985 🏛 IEEE 🌐 English ⚖ 504 KB

Upper bound on the minimum distance of t

✍ Breiling, M.; Huber, J.B. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 196 KB

Further asymptotic upper bounds on the m

✍ Pottie, G.J.; Calderbank, A.R. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 431 KB