On the Block Error Probability of LP Decoding of LDPC Codes
Ralf Koetter, Pascal O. Vontobel
TL;DR
This paper investigates the block error probability of LP decoding for regular LDPC codes, establishing threshold existence and bounds similar to those known for min-sum decoding.
Contribution
It extends the analysis of decoding thresholds and bounds from min-sum algorithms to linear programming decoding for regular LDPC codes.
Findings
Thresholds for LP decoding are shown to exist for regular LDPC codes.
Analytic bounds on these LP decoding thresholds are derived.
Results parallel those previously known for min-sum decoding.
Abstract
In his thesis, Wiberg showed the existence of thresholds for families of regular low-density parity-check codes under min-sum algorithm decoding. He also derived analytic bounds on these thresholds. In this paper, we formulate similar results for linear programming decoding of regular 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 Techniques