Abstract—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 multiedge 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 (BEC).
G. Liva, M. Chiani, M. Berioli, S. Scalise (2007). Some remarks on sparse graph codes for packet loss recovery. PISCATAWAY, NJ : IEEE.
Some remarks on sparse graph codes for packet loss recovery
CHIANI, MARCO;
2007
Abstract
Abstract—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 multiedge 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 (BEC).I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
