Bounds on the Threshold of Linear Programming Decoding
Information Theory
2007-07-16 v1 math.IT
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.
Cite
@article{arxiv.cs/0602087,
title = {Bounds on the Threshold of Linear Programming Decoding},
author = {Pascal O. Vontobel and Ralf Koetter},
journal= {arXiv preprint arXiv:cs/0602087},
year = {2007}
}