Minimum distance lower bounds for girth-constrained RA code ensembles
Weigang Chen, Liuguo Yin, Jianhua Lü · IEEE Transactions on Communications · 2010
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.