Skip to search formSkip to main contentSkip to account menu

Linear programming decoding

Known as: LP decoding 
In information theory and coding theory, linear programming decoding (LP decoding) is a decoding method which uses concepts from linear programming… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this paper, we develop a new decoding algorithm of binary linear codes for symbol-pair read channel. The Symbol-pair read… 
2011
2011
We present a new combinatorial characterization for local optimality of a codeword in an irregular Tanner code. The main novelty… 
2010
2010
Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community… 
2010
2010
In this paper, we introduce an efficient method for the joint linear-programming (LP) decoding of low-density parity-check (LDPC… 
2008
2008
Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this… 
2008
2008
While linear programming (LP) decoding provides more flexibility for finite-length performance analysis than iterative message… 
2008
2008
In the present paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is… 
Highly Cited
2007
Highly Cited
2007
We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically… 
Highly Cited
2007
Highly Cited
2007
A framework for linear-programming (LP) decoding of nonbinary linear codes over rings is developed. This framework facilitates LP… 
2003
2003
Given a linear code and observations from a noisy channel, the decoding problem is to de- termine the most likely (ML) codeword…