Andriyanova, Iryna2010-11-302010-11-302010-11-30200810.1109/ISIT.2008.4595317https://infoscience.epfl.ch/handle/20.500.14299/60893WOS:000260364401100In this paper we consider the finite-length performance of turbo codes in the waterfall region assuming the transmission on the binary erasure channel. We extend the finite-length scaling law of LDPC codes [1] and of Repeat-Accumulate codes [3] to this ensemble and we derive the scaling parameter. The obtained performance estimations match very well with numerical results.Finite-Length Scaling of Parallel Turbo Codes on the BECtext::conference output::conference proceedings::conference paper