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):||7 July 2008|
|PDF File Size:||6.88 Mb|
|ePub File Size:||12.66 Mb|
|Price:||Free* [*Free Regsitration Required]|
The encoding algorithm produces a set of n packets each containing b bits from a message of m packets containing b bits. Showing of 18 references. Topics Discussed in This Paper. Richard Wesley Hamming Reed-Solomon Codes and their Applications. Singleton bound Generator matrix Exclusive or Erasure code.
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 xod the bitwise exclusive-or XOR operation, and may be expressed in terms of a binary generator matrix.
Algorithm Network packet Time complexity Workstation.
See our FAQ for additional information. Skip to search form Skip to main content.
An XOR-Based Erasure-Resilient Coding Scheme
The decoding algorithm is able to recover the message from any set of r packets. Coding and information theory 2. The Theory of Error-Correcting Codes. An Introduction to Linear Algebra. Efficient dispersal of information for security, load balancing, and fault tolerance Michael O. Pursuit – The Journal of Undergraduate Research…. Showing of extracted citations. Citations Publications citing this paper. Citation Statistics Citations 0 20 40 ’94 ’99 ’05 ’11 ‘ PlankCatherine D.
Michael Luby – Citações do Google Acadêmico
PlankCatherine D. Singleton bound Search for additional papers on this topic. Showing of 15 extracted citations. This paper has citations. GreenanEthan L. This paper has 21 citations.
XOR’s, lower bounds and MDS codes for storage
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 storage systems James S.
PlankKevin M. Semantic Scholar estimates that this publication has citations based on the available data. PlankJianqiang LuoCatherine D. This paper has highly influenced 39 other papers.
References Publications referenced by this paper.
References Publications referenced by this paper. Topics Discussed in This Paper. From This Paper Topics from this paper. From This Paper Figures, tables, and topics from this paper. Heuristics for optimizing matrix-based erasure codes for fault-tolerant storage systems James S.