A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes

X Wu, X You, C Zhao - IEEE Transactions on Communications, 2008 - ieeexplore.ieee.org
The parity-check matrix of a quasi-cyclic low-density parity-check (QC-LDPC) code can be
compactly represented by a polynomial parity-check matrix. By using this compact …

A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes

X Wu, X You, C Zhao - IEEE Transactions on Communications, 2008 - infona.pl
The parity-check matrix of a quasi-cyclic low-density parity-check (QC-LDPC) code can be
compactly represented by a polynomial parity-check matrix. By using this compact …

[引用][C] A Necessary and Sufficient Condition for Determining the Girth of Quasi-Cyclic LDPC Codes

X WU, X YOU, C ZHAO - IEEE transactions on communications, 2008 - pascal-francis.inist.fr
A Necessary and Sufficient Condition for Determining the Girth of Quasi-Cyclic LDPC Codes
CNRS Inist Pascal-Francis CNRS Pascal and Francis Bibliographic Databases Simple search …