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):||1 August 2008|
|PDF File Size:||10.81 Mb|
|ePub File Size:||17.59 Mb|
|Price:||Free* [*Free Regsitration Required]|
Pursuit – The Journal of Undergraduate Research….
Erasure Resilient Transmission (ERT)
This paper has citations. An Introduction to Linear Algebra. PlankCatherine D. From This Paper Figures, tables, and topics from this paper. PlankKevin M. Heuristics for optimizing matrix-based erasure codes for fault-tolerant storage systems James S. This paper has 21 citations.
CiteSeerX — An XOR-Based Erasure-Resilient Coding Scheme
While erasure-resilienr 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 in terms of a binary generator matrix.
ReschJames S. Coding and information theory 2.
The encoding algorithm produces a set xor-baaed n packets each containing b bits from a message of m packets containing b bits. Topics Discussed in This Paper.
XOR’s, lower bounds and MDS codes for storage
Singleton bound Search for additional papers on this topic. Efficient dispersal of information for security, load balancing, and fault tolerance Michael O.
Showing of 15 extracted citations.
Showing of extracted citations. Citations Publications citing this paper. Topics Discussed in This Paper. Skip to search form Skip to main content.
Showing of 10 references. The Theory of Error-Correcting Codes. Richard Wesley Hamming This paper has highly influenced 39 other papers.
The decoding algorithm is able to recover the message from any set of r packets. An exploration of optimization algorithms and heuristics for the creation of encoding and zn schedules in erasure coding. Algorithm Network packet Time complexity Workstation. GreenanEthan L. From This Paper Topics from this paper.
Singleton bound Generator matrix Exclusive or Erasure code. Citation Statistics Citations 0 20 40 ’94 ’99 ’05 ’11 ‘ Semantic Scholar estimates that erasure-reesilient publication has citations based on the available data.