Single-exclusion number and the stopping redundancy of MDS codes
IEEE Transactions on Information Theory
On the probabilistic computation of the stopping redundancy of LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
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.90 |
For a linear code C, the stopping redundancy of C is defined as the minimum number of check nodes in a Tanner graph T for C such that the size of the smallest stopping set in T is equal to the minimum distance of C. Han and Siegel recently proved an upper bound on the stopping redundancy of general linear codes, using probabilistic analysis. For most code parameters, this bound is the best currently known. In this correspondence, we present several improvements upon this bound.