Results 1  10
of
16,226
LP decoding
 IN PROC. 41ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING
, 2003
"... Linear programming (LP) relaxation is a common technique used to find good solutions to complex optimization problems. We present the method of “LP decoding”: applying LP relaxation to the problem of maximumlikelihood (ML) decoding. An arbitrary binaryinput memoryless channel is considered. This t ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
Linear programming (LP) relaxation is a common technique used to find good solutions to complex optimization problems. We present the method of “LP decoding”: applying LP relaxation to the problem of maximumlikelihood (ML) decoding. An arbitrary binaryinput memoryless channel is considered
LP Decoding Achieves Capacity
 In SODA
, 2004
"... We give a linear programming (LP) decoder that achieves the capacity (optimal rate) of a wide range of probabilistic binary communication channels. This is the first such result for LP decoding. More generally, as far as the authors are aware this is the first known polynomialtime capacityachiev ..."
Abstract

Cited by 27 (3 self)
 Add to MetaCart
We give a linear programming (LP) decoder that achieves the capacity (optimal rate) of a wide range of probabilistic binary communication channels. This is the first such result for LP decoding. More generally, as far as the authors are aware this is the first known polynomialtime capacity
LowComplexity Nonbinary LP Decoding
, 2011
"... Trellisbased check node processing for lowcomplexity nonbinary LP decoding ..."
Abstract
 Add to MetaCart
Trellisbased check node processing for lowcomplexity nonbinary LP decoding
Lowcomplexity LP decoding of nonbinary linear codes
 IN PROCEEDINGS OF 48TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING
, 2013
"... Linear Programming (LP) decoding of LowDensity ..."
Reweighted LP Decoding for LDPC Codes
, 2011
"... We introduce a novel algorithm for decoding binary linear codes by linear programming. We build on the LP decoding algorithm of Feldman et al. and introduce a postprocessing step that solves a second linear program that reweights the objective function based on the outcome of the original LP decode ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We introduce a novel algorithm for decoding binary linear codes by linear programming. We build on the LP decoding algorithm of Feldman et al. and introduce a postprocessing step that solves a second linear program that reweights the objective function based on the outcome of the original LP
Decomposition Methods for Large Scale LP Decoding
"... Feldman et al. (IEEE Trans. Inform. Theory, Mar. 2005) showed that linear programming (LP) can be used to decode linear error correcting codes. The biterrorrate performance of LP decoding is comparable to stateoftheart BP decoders, but has significantly stronger theoretical guarantees. However, ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
Feldman et al. (IEEE Trans. Inform. Theory, Mar. 2005) showed that linear programming (LP) can be used to decode linear error correcting codes. The biterrorrate performance of LP decoding is comparable to stateoftheart BP decoders, but has significantly stronger theoretical guarantees. However
Guessing Facets: Polytope Structure and Improved LP Decoder
, 2009
"... We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander codes, every fractional pseudocodeword always has at least a constant fraction of nonintegral bits. We then prove that for expan ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander codes, every fractional pseudocodeword always has at least a constant fraction of nonintegral bits. We then prove
Channel coding LP decoding and compressed sensing LP decoding: further connections
 in Proc. 2010 Intern. Zurich Seminar on Communications
"... Abstract—Channel coding linear programming decoding (CCLPD) and compressed sensing linear programming decoding (CSLPD) are two setups that are formally tightly related. Recently, a connection between CCLPD and CSLPD was exhibited that goes beyond this formal relationship. The main ingredient was ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract—Channel coding linear programming decoding (CCLPD) and compressed sensing linear programming decoding (CSLPD) are two setups that are formally tightly related. Recently, a connection between CCLPD and CSLPD was exhibited that goes beyond this formal relationship. The main ingredient
The Limits of Error Correction with lp Decoding
"... Abstract—An unknown vector f in R n can be recovered from corrupted measurements y = Af + e where A m×n (m ≥ n) is the coding matrix if the unknown error vector e is sparse. We investigate the relationship of the fraction of errors and the recovering ability of lpminimization (0 < p ≤ 1) which r ..."
Abstract
 Add to MetaCart
Abstract—An unknown vector f in R n can be recovered from corrupted measurements y = Af + e where A m×n (m ≥ n) is the coding matrix if the unknown error vector e is sparse. We investigate the relationship of the fraction of errors and the recovering ability of lpminimization (0 < p ≤ 1) which
Results 1  10
of
16,226