A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
We consider turbo-structured low-density paritycheck (TS-LDPC) codes-structured regular codes whose Tanner graph is composed of two trees connected by an interleaver. TS-LDPC codes with good girth properties are easy to construct: careful design of the interleaver component prevents short cycles of any desired length in its Tanner graph. We present algorithms to construct TS-LDPC codes with arbitrary column weight j 2 and row weight k and arbitrary girth g. We develop a linear complexitydoi:10.1109/tit.2006.890690 fatcat:ywbluxer5rhxvlfzwnwykkccge