pith. sign in

arxiv: cs/0602086 · v1 · submitted 2006-02-26 · 💻 cs.IT · math.IT

On the Block Error Probability of LP Decoding of LDPC Codes

classification 💻 cs.IT math.IT
keywords codesdecodinglow-densityparity-checkregularthresholdsalgorithmanalytic
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.