Minimum distance lower bounds for girth-constrained RA code ensembles

Authors:
Weigang Chen;Liuguo Yin;Jianhua Lu
Affiliations:
School of Electronic and Information Engineering, Tianjin University, Tianjin, China and Department of Electronic Engineering, Tsinghua University;School of Aerospace, Tsinghua University, Beijing, China;Department of Electronic Engineering, Tsinghua University, Beijing, China
Venue:
IEEE Transactions on Communications
Year:
2010

Citing 2
Cited 0

Graph Theory With Applications

Graph Theory With Applications
The intractability of computing the minimum distance of a code

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Minimum distance lower bounds are derived using graphical enumeration and integer programming for girthconstrained 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.