DocumentCode
43983
Title
Several Explicit Constructions for (3,L) QC-LDPC Codes with Girth at Least Eight
Author
Guohua Zhang ; Rong Sun ; Xinmei Wang
Author_Institution
State Key Lab. of Integrated Service Networks, Xidian Univ., Xi´an, China
Volume
17
Issue
9
fYear
2013
fDate
Sep-13
Firstpage
1822
Lastpage
1825
Abstract
Some explicit constructions for exponent matrices which correspond to Tanner graphs with girth at least eight are proposed. From these results, for any row weight of L>3, (3,L) quasi-cyclic LDPC codes with girth at least eight are constructed for any circulant permutation matrix (CPM) size P>L(L+mod(L,2))/2.
Keywords
cyclic codes; graph theory; matrix algebra; parity check codes; (3,L) QC-LDPC codes; CPM size; Tanner graphs; circulant permutation matrix; explicit constructions; exponent matrices; girth at least eight; quasicyclic codes; Arrays; Computers; Equations; Parity check codes; Phase change materials; Sparse matrices; Sun; Circulant permutation matrix (CPM); girth; low-density parity-check (LDPC) codes; quasi-cyclic (QC);
fLanguage
English
Journal_Title
Communications Letters, IEEE
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2013.070913.130966
Filename
6560010
Link To Document