Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
In 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.