Bounds on the Threshold of Linear Programming Decoding
classification
💻 cs.IT
math.IT
keywords
decodinglinearprogrammingboundsensembleslow-densityparity-checkthresholds
read the original 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.
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.