Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A prototype implementation of archival Intermemory
Proceedings of the fourth ACM conference on Digital libraries
Analysis of random processes via And-Or tree evaluation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Scalable secure storage when half the system is faulty
Information and Computation
Scalable Secure Storage when Half the System Is Faulty
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The rainbow skip graph: a fault-tolerant constant-degree distributed data structure
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Exact emulation of a priority queue with a switch and delay lines
Queueing Systems: Theory and Applications
Proceedings of the conference on Design, automation and test in Europe
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
A new result on [k, k + 1]-factors containing given hamiltonian cycles
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
| Hi-index | 0.00 |
We develop an efficient scheme that produces an encoding of a given message such that the message can be decoded from any portion of the encoding that is approximately equal to the length of the message. More precisely, an (n,c,l,r)-erasure-resilient code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of l-bit packets of total length cn from an n-bit message. The decoding algorithm is able to recover the message from any set of packets whose total length is r, i.e., from any set of r/l packets. We describe erasure-resilient codes where both the encoding and decoding algorithms run in linear time and where r is only slightly larger than n