25 search results - page 4 / 5 » Exact Bounds on the Sizes of Covering Codes |
EUROCRYPT
2005
Springer
14 years 27 days ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
PKC
2009
Springer
14 years 8 months ago
2009
Springer
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, netw...
TIT
2008
13 years 7 months ago
2008
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
CORR
2011
Springer
13 years 2 months 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...