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):||24 January 2008|
|PDF File Size:||5.69 Mb|
|ePub File Size:||17.77 Mb|
|Price:||Free* [*Free Regsitration Required]|
From This Paper Figures, tables, and topics from this paper. PlankCatherine D.
This paper has highly influenced xor-bwsed other papers. Singleton bound Search for additional papers on this topic. Citations Publications citing this paper. References Publications referenced by this paper. Skip to search form Skip to main content. Pursuit – The Journal of Undergraduate Research….
XOR’s, lower bounds and MDS codes for storage
The Theory of Error-Correcting Codes. Topics Discussed in This Paper. An Introduction to Linear Algebra. Reed-Solomon Codes and their Applications. Showing of 18 references.
This paper has citations. Algorithm Network packet Time complexity Workstation. PlankKevin M.
Michael Luby – Citações do Google Acadêmico
Singleton bound Generator erasur-eresilient Exclusive or Erasure code. References Publications referenced by this paper. 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.
The decoding algorithm is able to recover the message from any set of r packets. Citations Publications citing this paper. PlankJianqiang LuoCatherine D. Erasure-resilient codes have been used to protect real-time traac sent through packet based networks against packet losses.
Citation Statistics Citations 0 20 40 ’94 ’99 ’05 ’11 ‘ See our FAQ for additional information.
ReschJames S. Richard Wesley Hamming Heuristics for optimizing matrix-based erasure codes for fault-tolerant storage systems James S. Showing of 10 references. GreenanEthan L.
Showing of extracted citations. The encoding algorithm produces a set of n packets each containing b bits from a message of m packets containing b bits.
Marek Karpinski – Google Scholar Citations
Showing of 15 extracted citations. 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 in terms of a binary generator matrix.