A cutting-plane method based on redundant rows for improving fractional distance
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Decreasing error floor in LDPC codes by parity-check matrix extensions
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Stopping set distributions of algebraic geometry codes from elliptic curves
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Hi-index | 754.84 |
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binary matrices with linearly dependent rows. These linearly dependent rows significantly reduce the number of stopping sets (SS) of small size. Upper and lower bounds on the average SS weight distribution of the redundant random ensembles are proved based on a combinatorial argument. Asymptotic forms of these bounds reveal asymptotic behavior of the average SS weight distributions. From these bounds, a tradeoff between the number of redundant rows (corresponding to decoding complexity of belief propagation on binary erasure channel) and the average SS weight distribution (corresponding to decoding performance) can be derived.