2 papers
cs.IT2017
On short cycle enumeration in biregular bipartite graphs
Ian Blake, Shu Lin
A number of recent works have used a variety of combinatorial constructions to derive Tanner graphs for LDPC codes and some of these have been shown to perform well in terms of the…
cs.IT2010
Circulant Arrays on Cyclic Subgroups of Finite Fields: Rank Analysis and Construction of Quasi-Cyclic LDPC Codes
Li Zhang, Shu Lin, Khaled Abdel-Ghaffar +2
This paper consists of three parts. The first part presents a large class of new binary quasi-cyclic (QC)-LDPC codes with girth of at least 6 whose parity-check matrices are constr…