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

Original language | English (US) |
---|---|

Pages (from-to) | 512-519 |

Number of pages | 8 |

Journal | Annual Symposium on Foundations of Computer Science - Proceedings |

State | Published - Dec 1 1995 |

Externally published | Yes |

Event | Proceedings of the 1995 IEEE 36th Annual Symposium on Foundations of Computer Science - Milwaukee, WI, USA Duration: Oct 23 1995 → Oct 25 1995 |

### All Science Journal Classification (ASJC) codes

- Hardware and Architecture

## Fingerprint Dive into the research topics of 'Linear time erasure codes with nearly optimal recovery (extended abstract)'. Together they form a unique fingerprint.

## Cite this

Alon, N., Edmonds, J., & Luby, M. (1995). Linear time erasure codes with nearly optimal recovery (extended abstract).

*Annual Symposium on Foundations of Computer Science - Proceedings*, 512-519.