Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,390,880 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Coding theory
Decoding methods
Information theory
Linear code
Expand
Broader (2)
Mathematical optimization
Operations research
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
When random search is not enough: Sample-Efficient and Noise-Robust Blackbox Optimization of RL Policies
K. Choromanski
,
Aldo Pacchiano
,
+4 authors
Vikas Sindhwani
arXiv.org
2019
Corpus ID: 71145660
Interest in derivative-free optimization (DFO) and"evolutionary strategies"(ES) has recently surged in the Reinforcement Learning…
Expand
2013
2013
Towards Hardware Implementation of the Simplex Algorithm for LP Decoding
Florian Gensheimer
,
Michael Helmling
2013
Corpus ID: 15505242
Combining methods of mathematical optimization theory and applications from communications engineering recently led to new…
Expand
2012
2012
LP decoding of expander codes: a simpler proof
M. Viderman
arXiv.org
2012
Corpus ID: 17155410
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…
Expand
2012
2012
Analog Product Codes Decodable by Linear Programming
A. Zanko
,
Amir Leshem
,
E. Zehavi
IEEE Transactions on Information Theory
2012
Corpus ID: 63362
In this paper, we present a new analog error correcting coding scheme for real valued signals that are corrupted by impulsive…
Expand
2012
2012
Extending lp--decoding for permutation codes from euclidean to Kendall tau metric
Justin Kong
2012
Corpus ID: 124933195
2008
2008
Coordinate-ascent method for linear programming decoding
P·O·冯托贝尔
,
S·贾拉里
2008
Corpus ID: 65445738
A decoder 104 or 700 is operable to decode data transmitted on a noisy communication channel 103. The decoder 104 or 700 includes…
Expand
2008
2008
A cutting plane method based on redundant rows for improving fractional distance
M. Miwa
,
T. Wadayama
,
I. Takumi
5th International Symposium on Turbo Codes and…
2008
Corpus ID: 17151020
In this paper, an idea of the cutting plane method is employed to improve the fractional distance of a given binary parity check…
Expand
2008
2008
Complexity scaling of mixed-integer linear programming decoding
S. Draper
2008
Corpus ID: 42170588
In this talk we discuss a hybrid belief-propagation (BP) / mi xed-integer linear programming (MI-LP) decoder. The failu re of a…
Expand
2008
2008
Decoding linear codes via optimization and graph-based techniques
M. H. Taghavi
2008
Corpus ID: 27588996
Low-density parity-check (LDPC) codes have made it possible to communicate at information rates very close to the Shannon…
Expand
2005
2005
On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes
Pascal O. Vontobel
,
R. Smarandache
arXiv.org
2005
Corpus ID: 11773778
We would like to better understand the fundamental cone of Tanner graphs derived from finite projective planes. Towards this goal…
Expand