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


Published in:
IEEE Transactions on Information Theory, 51, 7, 2352-2379
Year:
2005
Laboratories:




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


Rate this document:

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