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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

Adaptive linear programming (ALP) decoders are mainly used for decoding low-density parity-check (LDPC) codes. The principle of…

2015

In this work, we consider adaptive linear programming (LP) decoding of ternary linear codes, i. e., linear codes over the finite…

2014

Polar codes are high density parity check codes and hence the sparse factor graph, instead of the parity check matrix, has been…

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…

2010

In this paper, we introduce an efficient method for the joint linear-programming (LP) decoding of low-density parity-check (LDPC…

2009

Classical systems using hierarchical modulation (such as DVB-SH) involve a "high-priority" (HP) and a "low-priority" (LP) bit…

2008

In this paper, an idea of the cutting plane method is employed to improve the fractional distance of a given binary parity check…

2008

A decoder 104 or 700 is operable to decode data transmitted on a noisy communication channel 103. The decoder 104 or 700 includes…

2006

We illustrate the utility of the recently developed loop calculus (1), (2) for improving the Belief Propagation (BP) algorithm…

2002

In recent work (Feldman and Karger [8]), we introduced a new a pproach to decoding turbo-like codes based on linear programming…