Adaptive Linear Programming Decoding
Information Theory
2007-07-13 v1 math.IT
Abstract
Detectability of failures of linear programming (LP) decoding and its potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the LP problem. In this paper, we make a first step in studying this method, and show that it can significantly reduce the complexity of the problem, which was originally exponential in the maximum check-node degree. We further show that adaptively adding new constraints, e.g. by combining parity checks, can provide large gains in the performance.
Cite
@article{arxiv.cs/0601099,
title = {Adaptive Linear Programming Decoding},
author = {Mohammad H. Taghavi N. and Paul H. Siegel},
journal= {arXiv preprint arXiv:cs/0601099},
year = {2007}
}
Comments
5 pages, 4 figures. Submitted to the IEEE International Symposium on Information Theory (ISIT) 2006