Interior-Point Algorithms for Linear-Programming Decoding
Information Theory
2008-02-12 v1 math.IT
Abstract
Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of such algorithms for solving the linear program that appears in the linear-programming decoder formulation.
Cite
@article{arxiv.0802.1369,
title = {Interior-Point Algorithms for Linear-Programming Decoding},
author = {Pascal O. Vontobel},
journal= {arXiv preprint arXiv:0802.1369},
year = {2008}
}
Comments
Essentially the paper that appeared in Proc. 2008 Information Theory and Applications Workshop, UC San Diego, CA, USA, January 27 -- February 1, 2008