A linear time erasure-resilient code with nearly optimal recovery
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 42 (6), 1732-1736
- https://doi.org/10.1109/18.556669
Abstract
We develop an efficient scheme that produces an encoding of a given message such that the message can be decoded from any portion of the encoding that is approximately equal to the length of the message. More precisely, an (n,c,l,r)-erasure-resilient 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-resilient codes where both the encoding and decoding algorithms run in linear time and where r is only slightly larger than nKeywords
This publication has 9 references indexed in Scilit:
- Priority encoding transmissionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Expander codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Linear time erasure codes with nearly optimal recoveryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphsIEEE Transactions on Information Theory, 1992
- Performance evaluation of Forward Error Correction in ATM networksPublished by Association for Computing Machinery (ACM) ,1992
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989
- Explicit construction of linear sized tolerant networksDiscrete Mathematics, 1988
- Deterministic simulation in LOGSPACEPublished by Association for Computing Machinery (ACM) ,1987
- Explicit expanders and the Ramanujan conjecturesPublished by Association for Computing Machinery (ACM) ,1986