Capacity-Achieving Ensembles for the Binary Erasure Channel with Bounded Complexity


Published in:
Fourth ETH--Technion Meeting on Information Theory and Communications
Year:
2004
Laboratories:




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


Rate this document:

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