Bounds on the Threshold of Linear Programming Decoding
<|reference_start|>Bounds on the Threshold of Linear Programming Decoding: 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.<|reference_end|>
@article{vontobel2006bounds,
    title={Bounds on the Threshold of Linear Programming Decoding},
    author={Pascal O. Vontobel and Ralf Koetter},
    journal={Proc. IEEE Information Theory Workshop (ITW 2006), Punta del Este,
  Uruguay, March 13-17, 2006},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0602087},
    primaryClass={cs.IT math.IT}
}