Interior-Point Algorithms for Linear-Programming Decoding
classification
💻 cs.IT
math.IT
keywords
algorithmslinear-programminginterior-pointsolvingappearsclassconstitutedecoder
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.