1 citations · 1 across the 2 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2010★ 13 cited
Cyclic and Quasi-Cyclic LDPC Codes on Row and Column Constrained Parity-Check Matrices and Their Trapping Sets
Qin Huang, Qiuju Diao, Shu Lin +1
This paper is concerned with construction and structural analysis of both cyclic and quasi-cyclic codes, particularly LDPC codes. It consists of three parts. The first part shows t…
cs.IT2006★ 1 cited
Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators
Jos H. Weber, Khaled A. S. Abdel-Ghaffar
The performance of iterative decoding techniques for linear block codes correcting erasures depends very much on the sizes of the stopping sets associated with the underlying Tanne…
cs.IT2006
Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes
Khaled A. S. Abdel-Ghaffar, Jos H. Weber
Stopping sets, and in particular their numbers and sizes, play an important role in determining the performance of iterative decoders of linear codes over binary erasure channels.…