Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Asymptotically good codes correcting insertions, deletions, and transpositions
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Analysis of random processes via And-Or tree evaluation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Linear time encodable and list decodable codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Transmitting Datacubes over Congested Networks
ITCC '00 Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
Reconstructing strings from random traces
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Better extractors for better codes?
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Guest column: error-correcting codes and expander graphs
ACM SIGACT News
Failed disk recovery in double erasure RAID arrays
Journal of Discrete Algorithms
FlightPath: obedience vs. choice in cooperative services
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Algorithms and theory of computation handbook
Achieving multicast stream authentication using MDS codes
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
| Hi-index | 0.00 |
An (n,c,l,r) erasure 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 codes where both the encoding and decoding algorithms run in linear time and where r is only slightly larger than n.