Linear time erasure codes with nearly optimal recovery
Lists
Only you see this
Abstract
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.
BibTeX
@inproceedings{alon1995linear,
author = {Noga Alon and Jeff Edmonds and Michael Luby},
title = {{Linear time erasure codes with nearly optimal recovery}},
booktitle = {FOCS},
year = {1995},
doi = {10.1109/sfcs.1995.492581},
}Loading related content...