5 search results - page 1 / 1 » Linear Time Erasure Codes with Nearly Optimal Recovery (Exte... |
FOCS
1995
IEEE
13 years 8 months ago
1995
IEEE
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
ICC
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—Rateless coding ensures reliability by providing everincreasing redundancy, traditionally at the packet level (i.e. the application layer) through erasure coding. This p...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract--Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the store...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...