Computer Science – Information Theory
Scientific paper
2012-01-29
Computer Science
Information Theory
Scientific paper
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.
No associations
LandOfFree
Extended Extremes of Information Combining does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Extended Extremes of Information Combining, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extended Extremes of Information Combining will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-379245