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


Published in:
IEEE Transactions on Information Theory, 50, 6, 1247-1256
Year:
2004
Other identifiers:
Laboratories:




 Record created 2006-11-22, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)