DocumentCode
1505067
Title
Minimum distance lower bounds for girth-constrained RA code ensembles
Author
Chen, Weigang ; Yin, Liuguo ; Lu, Jianhua
Author_Institution
Dept. of Electron. Eng., Tsinghua Univ., Beijing, China
Volume
58
Issue
6
fYear
2010
fDate
6/1/2010 12:00:00 AM
Firstpage
1623
Lastpage
1626
Abstract
Minimum distance lower bounds are derived using graphical enumeration and integer programming for girth-constrained repeat-accumulate (RA) code ensembles. Moreover, the worst subgraphs in Tanner graphs leading to the minimum distance lower bounds and the probabilities they occur are analyzed.
Keywords
graph theory; integer programming; parity check codes; Tanner graphs; girth-constrained RA code ensembles; graphical enumeration; integer programming; low-density parity-check codes; minimum distance lower bounds; repeat-accumulate code; subgraphs; Aerospace engineering; Communications Society; Encoding; Iterative decoding; Linear programming; NP-hard problem; Parity check codes; Repeat-accumulate codes, low-density parity check codes, minimum distance lower bounds.;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2010.06.070652
Filename
5474626
Link To Document