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)

Related topics

Related topics

9 relations
Coding theoryDecoding methodsInformation theoryLinear code

Broader (2)

Mathematical optimizationOperations research

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2014
Review
2014
Linear Programming Decoding
  • 2014
  • Corpus ID: 244682265
Linear Programming Decoding was introduced by Feldman, Wainwright, and Karger in [1]. A very similar approach based on graph… 
2012
2012
Analog Product Codes Decodable by Linear Programming
In this paper, we present a new analog error correcting coding scheme for real valued signals that are corrupted by impulsive… 
2012
2012
LP decoding of expander codes: a simpler proof
A code $C \subseteq \F_2^n$ is a $(c,\epsilon,\delta)$-expander code if it has a Tanner graph, where every variable node has… 
2010
2010
An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels
In this paper, we introduce an efficient method for the joint linear-programming (LP) decoding of low-density parity-check (LDPC… 
2008
2008
A cutting plane method based on redundant rows for improving fractional distance
In this paper, an idea of the cutting plane method is employed to improve the fractional distance of a given binary parity check… 
2008
2008
Coordinate-ascent method for linear programming decoding
A decoder 104 or 700 is operable to decode data transmitted on a noisy communication channel 103. The decoder 104 or 700 includes… 
2008
2008
Complexity scaling of mixed-integer linear programming decoding
In this talk we discuss a hybrid belief-propagation (BP) / mi xed-integer linear programming (MI-LP) decoder. The failu re of a… 
2008
2008
LP Decoding
  • J. Feldman
  • Encyclopedia of Algorithms
  • 2008
  • Corpus ID: 2834642
Linear programming (LP) relaxation is a common technique us d to find good solutions to complex optimization problems. We present… 
2006
2006
On the Block Error Probability of LP Decoding of LDPC Codes
In his thesis, Wiberg showed the existence of thresholds for families of regular low-density parity-check codes under min-sum… 
2005
2005
On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes
We would like to better understand the fundamental cone of Tanner graphs derived from finite projective planes. Towards this goal… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)