Adaptive Methods for Linear Programming Decoding

Simple item page
dc.creatorTaghavi, Mohammad H.
dc.creatorSiegel, Paul H.
dc.date2007-03-24
dc.date.accessioned2026-07-07T08:17:09Z
dc.date.available2026-07-07T08:17:09Z
dc.descriptionDetectability 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.
dc.description22 pages, 8 figures. Submitted to IEEE Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/cs/0703123
dc.identifierhttp://arxiv.org/abs/cs/0703123
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134025
dc.subjectInformation Theory
dc.titleAdaptive Methods for Linear Programming Decoding
dc.typetext

Files

Collections

arXiv