Improved Probabilistic Bounds on Stopping Redundancy
Junsheng Han
Siegel, P.H.
Vardy, A.
Univ. of California San Diego, La Jolla;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: April 2008
Volume: 54,
Issue: 4
On page(s): 1749-1753
ISSN: 0018-9448
INSPEC Accession Number: 9943635
Digital Object Identifier: 10.1109/TIT.2008.917624
Current Version Published: 2008-03-21
Abstract
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
