Pith. sign in

REVIEW

Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1112.3730 v1 pith:LJYJWOHK submitted 2011-12-16 cs.IT math.IT

Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC

Enrico Paolini , Mark F. Flanagan , Marco Chiani , Marc P. C. Fossorier This is my paper
classification cs.IT math.IT
keywords codecodesensemblesstabilityconditiondecodingdoubly-generalizediterative
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Using the EXIT chart approach, a necessary and sufficient condition is developed for the local stability of iterative decoding of multi-edge type (MET) doubly-generalized low-density parity-check (D-GLDPC) code ensembles. In such code ensembles, the use of arbitrary linear block codes as component codes is combined with the further design of local Tanner graph connectivity through the use of multiple edge types. The stability condition for these code ensembles is shown to be succinctly described in terms of the value of the spectral radius of an appropriately defined polynomial matrix.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.