Finite-length scaling of repeat-accumulate codes on the BEC
In 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  to this ensemble and we derive the scaling parameter. The obtained performance estimations match very well with numerical results.
- View record in Web of Science
Record created on 2010-11-30, modified on 2016-08-09