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.
|Country:||Papua New Guinea|
|Published (Last):||27 May 2016|
|PDF File Size:||19.70 Mb|
|ePub File Size:||5.12 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.
David Zuckerman – Google Tudós Hivatkozások
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 ab citations. PlankKevin M. GreenanEthan L. Heuristics for optimizing matrix-based erasure codes for fault-tolerant storage systems James S.
An XOR-Based Erasure-Resilient Coding Scheme | Michael Luby and Johannes Blomer –
PlankCatherine D. Citation Statistics Citations 0 20 40 ’94 ’99 ’05 ’11 ‘ Semantic Scholar estimates that this 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. Reed-Solomon Codes and their Applications.
An XOR-Based Erasure-Resilient Coding Scheme
Coding and information theory 2. Richard Wesley Hamming An Introduction to Linear Algebra.