arXiv · cs/0602087
Bounds on the Threshold of Linear Programming Decoding
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Pascal O. Vontobel, Ralf Koetter. 2006-02-26. Bounds on the Threshold of Linear Programming Decoding. https://searcharxiv.com/abs/cs/0602087
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.