DMCA
Practical Loss-Resilient Codes (1997)
Cached
Download Links
| Citations: | 284 - 25 self |
BibTeX
@INPROCEEDINGS{Luby97practicalloss-resilient,
author = {Michael Luby and Michael Mitzenmacher and Amin Shokrollahi and Daniel Spielman and Volker Stemann},
title = {Practical Loss-Resilient Codes},
booktitle = {},
year = {1997},
pages = {150--159}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present a randomized construction 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. Partial implementations of our algorithms are faster by orders of magnitude than the best software implementations of any previous algorithm for this problem. We expect these codes will be extremely useful for applications such as real-time audio and video transmission over the Internet, where lossy channels are common and fast decoding is a requirement. Despite the simplicity of the algorithms, their design and analysis are mathematically intricate. The design requires the careful choice of a random irregular bipartite graph, where the structure of the irregular graph is extremely important. We model the progress of the decoding algorithm by a set of differential equations. The solution to these equations can then be expressed as p...
Keyphrases
practical loss-resilient code lossy channel random irregular bipartite graph real-time audio simple software implementation differential equation software implementation careful choice partial implementation previous algorithm randomized construction fast decoding video transmission decodable code irregular graph
