TY - JOUR

T1 - Linear time erasure codes with nearly optimal recovery (extended abstract)

AU - Alon, Noga

AU - Edmonds, Jeff

AU - Luby, Michael

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029512633&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0029512633

SN - 0272-5428

SP - 512

EP - 519

JO - Annual Symposium on Foundations of Computer Science - Proceedings

JF - Annual Symposium on Foundations of Computer Science - Proceedings

T2 - Proceedings of the 1995 IEEE 36th Annual Symposium on Foundations of Computer Science

Y2 - 23 October 1995 through 25 October 1995

ER -