2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/154543Interior-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.Essentially the paper that appeared in Proc. 2008 Information Theory and Applications Workshop, UC San Diego, CA, USA, January 27 -- February 1, 2008Information TheoryInterior-Point Algorithms for Linear-Programming Decodingtext