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 work, we consider adaptive linear programming (LP) decoding of ternary linear codes, i. e., linear codes over the finite… 
2013
2013
For a given family of spatially coupled codes, we prove that the LP threshold on the BSC of the tail-biting graph cover ensemble… 
2011
2011
We present a new combinatorial characterization for local optimality of a codeword in an irregular Tanner code. The main novelty… 
2010
2010
In this paper, we introduce an efficient method for the joint linear-programming (LP) decoding of low-density parity-check (LDPC… 
2009
2009
Classical systems using hierarchical modulation (such as DVB-SH) involve a "high-priority" (HP) and a "low-priority" (LP) bit… 
2008
2008
  • D. Burshtein
  • 2008
  • Corpus ID: 31359970
The iterative algorithm, for low complexity linear programming (LP) decoding of low-density parity-check (LDPC) codes, proposed… 
2008
2008
In this paper, an idea of the cutting plane method is employed to improve the fractional distance of a given binary parity check… 
2006
2006
Pseudocodewords of q-ary LDPC codes are examined and the weight of a pseudocodeword on the q-ary symmetric channel is defined… 
2002
2002
In recent work (Feldman and Karger [8]), we introduced a new a pproach to decoding turbo-like codes based on linear programming…