American Psychological Association 6th edition

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 and URBANKE, Rüdiger, 2005. Capacity-achieving ensembles for the binary erasure channel with bounded complexity. IEEE transactions on information theory. 1 January 2005. Vol. 51, no. 7, p. 2352-2379.

Modern Language Association 9th edition

PFISTER, H. D., I. SASON, and R. URBANKE. “Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity”. IEEE Transactions on Information Theory, vol. 51, no. 7, Jan. 2005, pp. 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 - Harvard

PFISTER, H.D., SASON, I. and URBANKE, R. (2005), “Capacity-achieving ensembles for the binary erasure channel with bounded complexity”, IEEE Transactions on Information Theory, Vol. 51 No. 7, pp. 2352-2379.

Warning: These citations may not always be 100% accurate.