⚠️ Following scheduled maintenance on Thursday 12 March, a data reindexation is currently in progress. Some publications may temporarily not appear in search results. Full availability is expected by Friday evening. We apologise for the inconvenience.
 
research article

Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel

Sason, I.  
•
Urbanke, R.  
2004
IEEE Transactions on Information Theory
Type
research article
DOI
10.1109/TIT.2004.828101
Web of Science ID

WOS:000221803300020

Author(s)
Sason, I.  
Urbanke, R.  
Date Issued

2004

Published in
IEEE Transactions on Information Theory
Volume

50

Issue

6

Start page

1247

End page

1256

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LTHC  
Available on Infoscience
November 22, 2006
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/235893