Adaptive Methods for Linear Programming Decoding

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the underlying 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.
22 pages, 8 figures. Submitted to IEEE Transactions on Information Theory

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134025

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0703123
 http://arxiv.org/abs/cs/0703123

Collections

arXiv