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;
