Extended Extremes of Information Combining
cs.IT
/ Authors
/ 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.