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):||4 August 2014|
|PDF File Size:||7.50 Mb|
|ePub File Size:||15.8 Mb|
|Price:||Free* [*Free Regsitration Required]|
The decoding algorithm is able to recover the message from any set of r packets.
Coding and information theory 2. Erasure-resilient codes have been used to protect real-time traac sent through packet based networks against packet losses.
Table II from XOR’s, lower bounds and MDS codes for storage – Semantic Scholar
From This Paper Topics from this paper. References Publications referenced by this paper. Citations Publications citing this paper.
Richard Wesley Hamming Pursuit – The Journal of Undergraduate Research…. PlankCatherine D.
An XOR-Based Erasure-Resilient Coding Scheme
This paper has highly influenced 39 other papers. From This Paper Figures, tables, and topics from this paper. Citations Publications citing this paper.
PlankCatherine D. Showing of 15 extracted citations. Algorithm Network packet Time complexity Workstation. Topics Discussed in This Paper. GreenanEthan L. Showing of 10 references. PlankJianqiang LuoCatherine D. Reed-Solomon Codes and their Applications.
Showing of 18 references.
David Zuckerman – Google Tudós Hivatkozások
The Theory of Error-Correcting Codes. References Publications referenced by this paper. An Introduction to Linear Algebra. Heuristics for optimizing matrix-based erasure codes for fault-tolerant storage systems James S.
While classic Reed-Solomon codes can provide a general-purpose MDS code for any situation, systems that require high performance rely on special-purpose codes that employ the bitwise exclusive-or XOR operation, and may be expressed resiliejt terms of a binary generator matrix. Singleton bound Search for additional papers on this topic. Skip to search form Skip edasure main content. PlankKevin M. This paper has 21 citations.
A Comprehensive Analysis of XOR-Based Erasure Codes Tolerating 3 or More Concurrent Failures
ReschJames S. Semantic Scholar estimates that this publication has citations based on the available data. Efficient dispersal of information for security, load balancing, and fault tolerance Michael O.
Skip to search form Skip to main content. An exploration of optimization algorithms and heuristics for the creation of encoding and decoding schedules in erasure coding. Heuristics for optimizing matrix-based erasure codes for fault-tolerant efasure systems James S. Citation Statistics Citations 0 20 40 ’94 ’99 ’05 ’11 ‘