Interior-Point Algorithms for Linear-Programming Decoding

Simple item page
dc.creatorVontobel, Pascal O.
dc.date2008-02-11
dc.date.accessioned2026-07-07T09:19:51Z
dc.date.available2026-07-07T09:19:51Z
dc.descriptionInterior-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.
dc.descriptionEssentially the paper that appeared in Proc. 2008 Information Theory and Applications Workshop, UC San Diego, CA, USA, January 27 -- February 1, 2008
dc.identifierhttps://arxiv.org/abs/0802.1369
dc.identifierhttp://arxiv.org/abs/0802.1369
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/154543
dc.subjectInformation Theory
dc.titleInterior-Point Algorithms for Linear-Programming Decoding
dc.typetext

Files

Collections

arXiv