Adaptive Methods for Linear Programming Decoding

DOI10.1109/TIT.2008.2006384zbMATH Open1247.93004arXivcs/0703123OpenAlexW2078633872MaRDI QIDQ3604926

Mohammad Hossein Taghavi, Paul H. Siegel

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/cs/0703123

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Linear programming (90C05)

Related Items (4)

Linear time adaptive arithmetic coding ⋮ A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding ⋮ Title not available (Why is that?) ⋮ Efficient Implementation of Linear Programming Decoding

This page was built for publication: Adaptive Methods for Linear Programming Decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604926)