AN XOR-BASED ERASURE-RESILIENT CODING SCHEME PDF
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.
|Country:||United Arab Emirates|
|Published (Last):||11 April 2007|
|PDF File Size:||14.60 Mb|
|ePub File Size:||7.26 Mb|
|Price:||Free* [*Free Regsitration Required]|
Richard Wesley Hamming Singleton bound Generator matrix Exclusive or Erasure code. Showing of 10 references. GreenanEthan L. PlankJianqiang LuoCatherine D.
The encoding algorithm produces a set of n packets each containing b bits from a message of m packets containing b bits.
Reed-Solomon Codes and their Applications. PlankCatherine D.
XOR’s, lower bounds and MDS codes for storage
Pursuit – The Journal of Undergraduate Research…. Heuristics for optimizing matrix-based erasure codes for fault-tolerant storage systems James S. PlankKevin M. Efficient dispersal of information for security, load balancing, and fault tolerance Michael O. Citation Statistics Citations 0 20 40 ’94 ’99 ’05 ’11 ‘ Erasure-resilient codes have been used to protect real-time traac sent through packet based networks against packet losses.
References Publications referenced by this paper. This paper has 21 citations. Showing of 18 references. From This Paper Figures, tables, and topics from this paper. The Theory of Error-Correcting Codes. Topics Discussed in This Paper. 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.
PlankCatherine D. Showing of extracted citations. Showing of 15 extracted citations.
This paper has citations. An Introduction to Linear Algebra. 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. See our FAQ for additional information.
David Zuckerman – Google Tudós Hivatkozások
Topics Discussed in This Paper. ReschJames S. Skip to search form Skip to main content. Coding and information theory 2. This paper has highly influenced 39 other papers.
References Publications referenced by this paper.
Singleton bound Search for additional wrasure-resilient on this topic. Algorithm Network packet Time complexity Workstation.