%0 Journal Article
%T Extended Extremes of Information Combining
%A Lucas Boczkowski
%J Mathematics
%D 2012
%I arXiv
%X 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.
%U http://arxiv.org/abs/1201.6046v2