8 search results - page 1 / 2 » Single-Exclusion Number and the Stopping Redundancy of MDS C... |
CORR
2007
Springer
13 years 4 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...
MSN
2005
Springer
13 years 10 months ago
2005
Springer
Key pre-distribution techniques for security provision of Wireless Sensor Networks (WSNs) have attracted significant interests recently. In these schemes, a relatively small numbe...
TIT
2008
13 years 4 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...
TIT
2008
13 years 4 months ago
2008
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 binar...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract--We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that a...