STOC   1997 Annual ACM Symposium on Theory of Computing
Wall of Fame | Most Viewed STOC-1997 Paper
257views Algorithms» more  STOC 1997»
13 years 10 months ago
Practical Loss-Resilient Codes
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 decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source257
2Download preprint from source172
3Download preprint from source131
4Download preprint from source129
5Download preprint from source126
6Download preprint from source125
7Download preprint from source122
8Download preprint from source116
9Download preprint from source111
10Download preprint from source106
11Download preprint from source102
12Download preprint from source97
13Download preprint from source95
14Download preprint from source91
15Download preprint from source91
16Download preprint from source88
17Download preprint from source82
18Download preprint from source76