A finite-length algorithm for LDPC codes without repeated edges on the binary erasure channel

This paper considers the performance, on the binary erasure channel, of low-density parity-check (LDPC) codes without repeated edges in their Tanner graphs. A modification to existing finite-length analysis algorithms is presented for these codes