Practical loss-resilient codes
Michael G. Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi et al. · ACM Symposium on Theory of Computing (STOC) · 1997
Abstract | We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decoding algorithms for these codes have fast and simple software implementations. Implementations of our algorithms are faster by orders of magnitude than the software implementations of previous algorithms. We expect these codes will be extremely useful for applications where lossy channels are common and fast decoding is a requirement, e.g., satellite transmission and multicast transmission over the Internet. I.
Cited by 732 works. doi:10.1145/258533.258573
Authors
References
- The Theory of Error-Correcting Codes
- Low-density parity-check codes
- Theory and practice of error control codes
- Measurements and analysis of end-to-end Internet dynamics
- Expander codes
- Packet loss correlation in the MBone multicast network
- Linear-time encodable and decodable error-correcting codes
- Approximation of Population Processes
- Priority encoding transmission
- A linear time erasure-resilient code with nearly optimal recovery