Extended Extremes of Information Combining
Information Theory
2012-02-01 v2 math.IT
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.
Cite
@article{arxiv.1201.6046,
title = {Extended Extremes of Information Combining},
author = {Lucas Boczkowski},
journal= {arXiv preprint arXiv:1201.6046},
year = {2012}
}