Interior-Point Algorithms for Linear-Programming Decoding

Details Interior-Point Algorithms for Linear-Programming Decoding Interior-Point Algorithms for Linear-Programming Decoding

2008-02-11

arxiv.org/abs/0802.1369v1

Computer Science

Information Theory

Essentially the paper that appeared in Proc. 2008 Information Theory and Applications Workshop, UC San Diego, CA, USA, January

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Interior-Point Algorithms for Linear-Programming Decoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Interior-Point Algorithms for Linear-Programming Decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interior-Point Algorithms for Linear-Programming Decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-624810