Reducing the Error Floor

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.

6 pages, 1 figure, invited talk at ITW'07 Tahoe

References in corpus (2)

• Loop series for discrete statistical models on graphs
• Improving convergence of Belief Propagation decoding

Cited by in corpus (1)

• A Separation Algorithm for Improved LP-Decoding of Linear Block Codes