Extended Extremes of Information Combining
classification
💻 cs.IT
math.IT
keywords
analysiscodescombiningextremesinequalitiesinformationappliedconcrete
read the original abstract
Extremes of information combining inequalities play an important role in the analysis of sparse-graph codes under message-passing decoding. We introduce new tools for the derivation of such inequalities, and show by means of a concrete examples how they can be applied to solve some optimization problems in the analysis of low-density parity-check codes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.