In this paper we construct an erasure-resilient coding scheme that is based on a version of Reed-Solomon codes and which has the property that r = m. An xor based erasure resilient coding scheme pdf. so im worried i wont have enough space on my phone. Double-click on the saved file to start the installation . Sorry, this document isn’t available for viewing at this time. In the meantime, you can download the document by clicking the ‘Download’ button above.
|Published (Last):||3 September 2014|
|PDF File Size:||8.78 Mb|
|ePub File Size:||11.51 Mb|
|Price:||Free* [*Free Regsitration Required]|
Skip to search form Skip to main content.
The encoding algorithm produces a set of n packets each containing b bits from a message of m packets containing b bits. The decoding algorithm is able to recover the message from any set of r packets.
Erasure-resilient codes have been used to protect real-time traac sent through packet based networks against packet losses. This paper has highly influenced 39 other papers. This paper has citations.
From This Paper Topics from this paper. Topics Discussed in This Paper. Algorithm Network packet Time complexity Workstation. Citations Publications citing this paper. Showing of extracted citations.
PlankKevin M. GreenanEthan L. Heuristics for optimizing matrix-based erasure codes for fault-tolerant storage systems James S. PlankCatherine D.
Erasure Resilient Transmission (ERT)
Citation Statistics Citations 0 20 40 ’94 ’99 ’05 ’11 ‘ Semantic Scholar estimates that reesilient publication has citations based on the available data. See our FAQ for additional information. References Publications referenced by this paper. Showing of 10 references. The Theory of Error-Correcting Codes. Efficient dispersal of information for security, load balancing, and fault tolerance Michael O.
An XOR-Based Erasure-Resilient Coding Scheme | ICSI
Reed-Solomon Codes and their Applications. Coding and information theory 2. Richard Wesley Hamming An Introduction to Linear Algebra.