DocumentCode
3426679
Title
Reducing the Error Floor
Author
Chertkov, Michael
Author_Institution
Los Alamos Nat. Lab., Los Alamos
fYear
2007
fDate
2-6 Sept. 2007
Firstpage
230
Lastpage
235
Abstract
We discuss how the loop calculus approach of [Chertkov, Chernyak ´06], enhanced by the pseudo-codeword search algorithm of [Chertkov, Stepanov ´06] and the facet-guessing idea from [Dimakis, Wainwright ´06], improves decoding of graph based codes in the error-floor domain. The utility of the new, linear programming based, decoding is demonstrated via analysis and simulations of the model [155,64, 20] code.
Keywords
decoding; graph theory; linear programming; decoding; error-floor domain; graph based codes; linear programming; loop calculus approach; 1f noise; Analytical models; Calculus; Iterative decoding; Laboratories; Lakes; Linear programming; Maximum likelihood decoding; Parity check codes; Partitioning algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 2007. ITW '07. IEEE
Conference_Location
Tahoe City, CA
Print_ISBN
1-4244-1564-0
Electronic_ISBN
1-4244-1564-0
Type
conf
DOI
10.1109/ITW.2007.4313079
Filename
4313079
Link To Document