Some Remarks on Sparse Graph Codes for Packet Loss Recovery

In this paper we provide some novel design techniques for sparse-graph-based erasure correcting codes. The paper is focused on codes based on sparse graph belonging to the category of the so-called generalized low-density parity-check (G-LDPC) codes. Some design insights are provided for multi-edge type G-LDPC codes based on protographs. The performance assessment of some G-LDPC codes is carried out by use of both simulation and analytic tools, showing the capacity-approaching performance of the presented code designs on the uncorrelated binary erasure channel.