386 search results - page 3 / 78 » The Weights in MDS Codes |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...
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...
DCC
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract. An (n, k)q-MDS code C over an alphabet A (of size q) is a collection of qk n-tuples over A such that no two words of C agree in as many as
CORR
2011
Springer
13 years 9 days ago
2011
Springer
—MDS array codes are widely used in storage systems to protect data against erasures. We address the rebuilding ratio problem, namely, in the case of erasures, what is the the fr...
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...