2 search results - page 1 / 1 » Improved Probabilistic Bounds on Stopping Redundancy |
TIT
2008
13 years 5 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...