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