PFISTER, H. D., SASON, I., & URBANKE, R. (2005). Capacity-achieving ensembles for the binary erasure channel with bounded complexity. IEEE Transactions on Information Theory, 51(7), 2352-2379.
ISO-690 (author-date, English)PFISTER, Henry D, SASON, Igal und URBANKE, Rüdiger, 2005. Capacity-achieving ensembles for the binary erasure channel with bounded complexity. IEEE transactions on information theory. 1 Januar 2005. Vol. 51, no. 7, p. 2352-2379.
Modern Language Association 9th editionPFISTER, H. D., I. SASON, und R. URBANKE. „Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity“. IEEE Transactions on Information Theory, Bd. 51, Nr. 7, Januar 2005, S. 2352-79.
Mohr Siebeck - Recht (Deutsch - Österreich)PFISTER, Henry D/SASON, Igal/URBANKE, Rüdiger: Capacity-achieving ensembles for the binary erasure channel with bounded complexity, IEEE transactions on information theory 2005, 2352-2379.
Emerald - HarvardPFISTER, H.D., SASON, I. und URBANKE, R. (2005), „Capacity-achieving ensembles for the binary erasure channel with bounded complexity“, IEEE Transactions on Information Theory, Vol. 51 No. 7, S. 2352-2379.