Reducing the Error Floor
Chertkov, M.
Los Alamos Nat. Lab., Los Alamos;
This paper appears in: Information Theory Workshop, 2007. ITW '07. IEEE
Publication Date: 2-6 Sept. 2007
On page(s): 230-235
Location: Tahoe City, CA,
ISBN: 1-4244-1564-0
INSPEC Accession Number: 9827073
Digital Object Identifier: 10.1109/ITW.2007.4313079
Current Version Published: 2007-09-24
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
