Linear Time Erasure Codes With Nearly Optimal (Extended Abstract)

An (n, c, &, r)-erasure code consasts of an encodang algorathm and a decodang algorzthm wath the followang propertaes. The encodang algorzthm produces a set of &-bat packets of total length en from an n-bat message. The decodang algorathm as able to recover the message from any set of packets whose total length as r, a.e., from any set of rll packets. We descrabe erasure codes where both the encodang and decodang aigorathms run an lanear tame and where r as only slaghtly larger than n.