✦ LIBER ✦

On Sparse Parity Check Matrices

✍ Scribed by Hanno Lefmann; Pavel Pudlák; Petr Savicky

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast low-density parity-check code sim

✍ Shek F. Yau; Tan L. Wong; Francis C. M. Lau; Yejun He 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 845 KB

On the minimum distance of low-density p

✍ A. Sridharan; M. Lentmaier; D. V. Truhachev; D. J. Costello; K. Sh. Zigangirov 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 186 KB

On the Stopping Distance of Array Code P

✍ Esmaeili, M.; Amoshahy, M.J. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 171 KB

Construction of binary minimal product p

✍ Morteza Esmaeili 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 153 KB

Parity check matrices and product repres

✍ Assaf Naor; Jacques Verstraëte 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 300 KB

Burst Decoding of Cyclic Codes Based on

✍ Shumei Song; Shu Lin; Abdel-Ghaffar, K.; Zhi Ding; Fong, W.H.; Fossorier, M.P.C. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 258 KB