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
fDate :
6/1/2010 12:00:00 AM
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.;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOMM.2010.06.070652
