TY - GEN
T1 - Reducing the error floor
AU - Chertkov, Michael
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=46749093418&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=46749093418&partnerID=8YFLogxK
U2 - 10.1109/ITW.2007.4313079
DO - 10.1109/ITW.2007.4313079
M3 - Conference contribution
AN - SCOPUS:46749093418
SN - 1424415640
SN - 9781424415649
T3 - 2007 IEEE Information Theory Workshop, ITW 2007, Proceedings
SP - 230
EP - 235
BT - 2007 IEEE Information Theory Workshop, ITW 2007, Proceedings
T2 - 2007 IEEE Information Theory Workshop, ITW 2007
Y2 - 2 September 2007 through 6 September 2007
ER -