Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

4

CORR
2004
Springer

favoriteEmaildiscussreport

81views Education» more CORR 2004»

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

13 years 4 months ago

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

Download webee.technion.ac.il

Henry D. Pfister, Igal Sason, Rüdiger L. Urba

Real-time Traffic

CORR 2004 | Education |

claim paper

Related Content

» Bounds on the decoding complexity of punctured codes on graphs

» Finitelength analysis of lowdensity paritycheck codes on the binary erasure channel

» Average Stopping Set Weight Distributions of Redundant Random Ensembles

» Simple capacityachieving ensembles of rateless erasurecorrecting codes

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	CORR
Authors	Henry D. Pfister, Igal Sason, Rüdiger L. Urbanke

Comments (0)