An LP decoding algorithm based on primal path-following interior point method

Authors:
Tadashi Wadayama
Affiliations:
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 2
Cited 1

Convex Optimization

Convex Optimization
Using linear programming to Decode Binary linear codes

IEEE Transactions on Information Theory

Interior point decoding for linear vector channels based on convex optimization

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

The paper presents an implementation of LP decoding algorithm based on the primal path-following interior point method. Numerical examples show some behaviors of an LP decoder based on the exact interior point method. It is shown that very accurate solution can be obtained after 40-50 iterations of the outer loop of the interior point method. Complexity analysis on the proposed algorithm is given as well.