Andriyanova, Iryna2010-11-302010-11-302010-11-30200810.1109/IZS.2008.4497277https://infoscience.epfl.ch/handle/20.500.14299/61404WOS:000255784400017In this paper we consider the finite-length performance of Repeat-Accumulate codes in the waterfall region assuming the transmission on the binary erasure channel. We extend the finite-length scaling law of LDPC codes [1] to this ensemble and we derive the scaling parameter. The obtained performance estimations match very well with numerical results.text::conference output::conference proceedings::conference paper