DocumentCode
1976473
Title
Bounds on the Threshold of Linear Programming Decoding
Author
Vontobel, Pascal O. ; Koetter, Ralf
Author_Institution
Dept. of EECS, Massachusetts Institute of Technology, Cambridge, MA 02139, USA, pascal.vontobel@ieee.org
fYear
2006
fDate
13-17 March 2006
Firstpage
175
Lastpage
179
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.
Keywords
Data communication; H infinity control; Iterative decoding; Iterative methods; Linear code; Linear programming; Paper technology; Parity check codes; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 2006. ITW '06 Punta del Este. IEEE
Conference_Location
Punta del Este, Uruguay
Print_ISBN
1-4244-0035-X
Electronic_ISBN
1-4244-0036-8
Type
conf
DOI
10.1109/ITW.2006.1633805
Filename
1633805
Link To Document