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):||21 September 2006|
|PDF File Size:||5.58 Mb|
|ePub File Size:||12.40 Mb|
|Price:||Free* [*Free Regsitration Required]|
See our FAQ for additional information.
PlankJianqiang LuoCatherine D. The decoding algorithm is able to recover the message from any set of r packets.
An Xor-based Erasure-resilient Coding Scheme
Showing of extracted citations. Heuristics for optimizing matrix-based erasure codes for fault-tolerant storage systems James S. This paper has 21 citations.
Heuristics for optimizing matrix-based erasure codes for fault-tolerant storage systems James S. References Publications referenced by this paper. Pursuit – The Journal of Undergraduate Research….
Showing of 10 references. This paper has citations.
Coding and information theory 2. An exploration of optimization algorithms and heuristics for the creation of encoding and decoding schedules in erasure coding.
Showing of 15 extracted citations. Showing of 18 references. PlankCatherine D. Semantic Scholar estimates that srasure publication has citations based on the available data. GreenanEthan L.
Citations Publications citing this paper. While classic Reed-Solomon codes can provide a general-purpose MDS code reasure 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. References Publications referenced by this paper. Richard Wesley Hamming Topics Discussed in This Paper. From This Paper Figures, tables, and topics from this paper. Efficient dispersal of information for security, load balancing, and fault tolerance Michael O.
Skip to search form Skip to main content. Skip to search form Skip to main content. This paper has highly influenced 39 other papers.
A Comprehensive Analysis of XOR-Based Erasure Codes Tolerating 3 or More Concurrent Failures
Algorithm Network packet Time complexity Workstation. The encoding algorithm produces a set of n packets each containing b bits from a message of m packets containing b bits.
An Introduction to Linear Algebra. Reed-Solomon Codes and their Applications. Xof bound Generator matrix Exclusive or Erasure code. The Theory of Error-Correcting Codes.
Michael Luby – Citações do Google Acadêmico
Topics Discussed in This Paper. Erasure-resilient codes have been used to protect real-time traac sent through packet based networks against packet losses. PlankCatherine D. Citations Publications citing this paper.