Extended Extremes of Information Combining
Lucas Boczkowski
TL;DR
This paper introduces new tools for deriving inequalities related to information combining, aiding the analysis and optimization of low-density parity-check codes in message-passing decoding.
Contribution
The paper presents novel methods for deriving information combining inequalities and demonstrates their application to optimize LDPC code analysis.
Findings
New tools for information combining inequalities
Application to optimize LDPC code analysis
Enhanced understanding of message-passing decoding
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Cooperative Communication and Network Coding · Advanced Wireless Communication Technologies