Bounds on the Threshold of Linear Programming Decoding
Pascal O. Vontobel, Ralf Koetter
TL;DR
This paper investigates the limits of linear programming decoding for low-density parity-check codes by establishing bounds on their decoding thresholds, addressing a significant gap in current coding theory knowledge.
Contribution
It provides the first known bounds on the decoding thresholds of LDPC codes under linear programming decoding, advancing understanding in coding theory.
Findings
Derived bounds on decoding thresholds for LDPC codes
Identified conditions where LP decoding performs optimally
Extended theoretical understanding of LP decoding limits
Abstract
Whereas many results are known about thresholds for ensembles of low-density parity-check codes under message-passing iterative decoding, this is not the case for linear programming decoding. Towards closing this knowledge gap, this paper presents some bounds on the thresholds of low-density parity-check code ensembles under linear programming decoding.
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