Reducing the Error Floor

TL;DR

This paper explores an improved decoding method for graph-based codes in the error-floor domain, combining loop calculus, pseudo-codeword search, and facet-guessing techniques, with demonstrated effectiveness through analysis and simulations.

Contribution

It introduces a new Linear Programming based decoding approach that enhances error-floor performance by integrating multiple advanced techniques.

Findings

Improved decoding performance in the error-floor region.

Successful application to the [155,64,20] code model.

Demonstrated effectiveness through simulations and analysis.

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.