Finite-Length Repeat-Accumulate Codes on the Binary Erasure Channel

This paper considers the finite-length performance of repeat-accumulate codes on the binary erasure channel. We provide lower bounds for the minimum stopping set size of RA codes and develop finite-length analysis algorithms for them. Using these results the effect of the RA accumulator and the choice of repetition rate on the decoding performance of finite length RA codes is investigated, and their performance compared to that of low-density parity-check codes