Search Results - "Linear-programming decoding"

Exploiting Parity-Polytope Geometry in Approximate and Randomized Scheduled ADMM-LP Decoding by Asadzadeh, Amirreza, Ho, Anthony, Kschischang, Frank R., Draper, Stark C.

“…We present two strategies to reduce the complexity of the alternating direction method of multipliers when applied to linear programming (ADMM-LP) decoding of…”
Get full text

Reduced-Complexity Linear Programming Decoding Based on ADMM for LDPC Codes by Wei, Haoyuan, Jiao, Xiaopeng, Mu, Jianjun

“…The Euclidean projection onto check polytopes is the most time-consuming operation in the linear programming (LP) decoding based on alternating direction…”
Get full text

LDPC Codes for Compressed Sensing by Dimakis, A. G., Smarandache, R., Vontobel, P. O.

“…We present a mathematical connection between channel coding and compressed sensing. In particular, we link, on the one hand, channel coding linear programming…”
Get full text

Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function by Vontobel, Pascal O.

“…We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original,…”
Get full text

Minimum-Polytope-Based Linear Programming Decoder for LDPC Codes via ADMM Approach by Bai, Jing, Wang, Yongchao, Lau, Francis C. M.

“…In this letter, we develop an efficient linear programming (LP) decoding algorithm for low-density parity-check (LDPC) codes. The LP relaxation is formulated…”
Get full text

LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes by Ghazi, Badih, Lee, Euiwoong

“…Random <inline-formula> <tex-math notation="LaTeX">(d_{v},d_{c}) </tex-math></inline-formula>- regular low-density parity-check (LDPC) codes, where each…”
Get full text

Towards Practical Near-Maximum-Likelihood Decoding of Error-Correcting Codes: An Overview by Tonnellier, Thibaud, Hashemipour, Marzieh, Doan, Nghia, Gross, Warren J., Balatsoukas-Stimming, Alexios

“…While in the past several decades the trend to go towards increasing error-correcting code lengths was predominant to get closer to the Shannon limit,…”
Get full text

Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity by Burshtein, D.

“…The problem of low complexity linear programming (LP) decoding of low-density parity-check (LDPC) codes is considered. An iterative algorithm, similar to…”
Get full text

Pseudocodeword-free criterion for codes with cycle-free Tanner graph by Kositwattanarerk, Wittawat

“…Iterative decoding and linear programming decoding are guaranteed to converge to the maximum-likelihood codeword when the underlying Tanner graph is…”
Get full text

Low-Complexity LP Decoding of Nonbinary Linear Codes by Punekar, M., Vontobel, P. O., Flanagan, M. F.

“…Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. LP…”
Get full text

Linear-Programming Decoding of Nonbinary Linear Codes by Flanagan, M.F., Skachek, V., Byrne, E., Greferath, M.

“…A framework for linear-programming (LP) decoding of nonbinary linear codes over rings is developed. This framework facilitates LP-based reception for coded…”
Get full text

Instanton-based techniques for analysis and reduction of error floors of LDPC codes by Chilappagari, S., Chertkov, M., Stepanov, M., Vasic, B.

“…We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes…”
Get full text

Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance by Burshtein, D., Goldenberg, I.

“…We examine LDPC codes decoded using linear programming (LP). Four contributions to the LP framework are presented. First, a new method of tightening the LP…”
Get full text

Probabilistic Analysis of Linear Programming Decoding by Daskalakis, C., Dimakis, A.G., Karp, R.M., Wainwright, M.J.

“…We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random…”
Get full text

A cutting-plane method based on redundant rows for improving fractional distance by Miwa, M., Wadayama, T., Takumi, I.

“…Decoding performance of linear programming (LP) decoding is closely related to geometrical properties of a fundamental polytope: fractional distance, pseudo…”
Get full text

Lowering the Error Floor of ADMM Penalized Decoder for LDPC Codes by Jiao, Xiaopeng, Mu, Jianjun

“…Decoding by alternating direction method of multipliers （ADMM） is a promising linear programming decoder for low-density par- ity-check （LDPC） codes. In…”
Get full text

LP Decoding of Regular LDPC Codes in Memoryless Channels by Halabi, Nissim, Even, Guy

“…We study error bounds for linear programming decoding of regular low-density parity-check (LDPC) codes. For memoryless binary-input output-symmetric channels,…”
Get full text

Improved Check Node Decomposition for Linear Programming Decoding by Xiaopeng Jiao, Jianjun Mu

“…For the linear programming decoding (LPD) proposed by Feldman et al., the number of constraints increases exponentially with check degrees. By decomposing a…”
Get full text

An Efficient Instanton Search Algorithm for LP Decoding of LDPC Codes Over the BSC by Chilappagari, S K, Chertkov, M, Vasic, B

“…We consider linear programming (LP) decoding of a fixed low-density parity-check (LDPC) code over the binary symmetric channel (BSC). The LP decoder fails when…”
Get full text

A Decomposition Theory for Binary Linear Codes by Kashyap, N.

“…The decomposition theory of matroids initiated by Paul Seymour in the 1980s has had an enormous impact on research in matroid theory. This theory, when applied…”
Get full text