English
Related papers

Related papers: On the Joint Decoding of LDPC Codes and Finite-Sta…

200 papers

This paper presents new FEC codes for the erasure channel, LDPC-Band, that have been designed so as to optimize a hybrid iterative-Maximum Likelihood (ML) decoding. Indeed, these codes feature simultaneously a sparse parity check matrix,…

Information Theory · Computer Science 2009-01-23 Alexandre Soro , Mathieu Cunche , Jerome Lacan , Vincent Roca

The error floor phenomenon observed with LDPC codes and their graph-based, iterative, message-passing (MP) decoders is commonly attributed to the existence of error-prone substructures -- variously referred to as near codewords, trapping…

Information Theory · Computer Science 2013-09-11 Xiaojie Zhang , Paul H. Siegel

Most low-density parity-check (LDPC) code constructions are considered over finite fields. In this work, we focus on regular LDPC codes over integer residue rings and analyze their performance with respect to the Lee metric. Their…

Information Theory · Computer Science 2024-08-01 Jessica Bariffi , Hannes Bartz , Gianluigi Liva , Joachim Rosenthal

A lower bound on the maximum likelihood (ML) decoding error exponent of linear block code ensembles, on the erasure channel, is developed. The lower bound turns to be positive, over an ensemble specific interval of erasure probabilities,…

Information Theory · Computer Science 2019-01-23 Enrico Paolini , Gianluigi Liva

This paper proposes two approaches for reducing the impact of the error floor phenomenon when decoding quantum low-density parity-check codes with belief propagation based algorithms. First, a low-complexity syndrome-based linear…

Information Theory · Computer Science 2024-01-22 Sana Javed , Francisco Garcia-Herrero , Bane Vasic , Mark F. Flanagan

It is shown that any communication system which admits a sum-product (SP) receiver also admits a corresponding linear-programming (LP) receiver. The two receivers have a relationship defined by the local structure of the underlying…

Information Theory · Computer Science 2008-09-18 Mark F. Flanagan

Low-density parity-check (LDPC) codes have been used for communication over a two-user Gaussian broadcast channel. It has been shown in the literature that the optimal decoding of such system requires joint decoding of both user messages at…

Information Theory · Computer Science 2016-11-18 Mahdi Ramezani , Masoud Ardakani

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 relaxation, and thus improving the LP decoder, is proposed. Second, we present an…

Information Theory · Computer Science 2016-11-17 David Burshtein , Idan Goldenberg

Inspired by the recent advances in deep learning (DL), this work presents a deep neural network aided decoding algorithm for binary linear codes. Based on the concept of deep unfolding, we design a decoding network by unfolding the…

Information Theory · Computer Science 2020-02-19 Yi Wei , Ming-Min Zhao , Min-Jian Zhao , Ming Lei

Partial decoding has the potential to achieve a larger capacity region than full decoding in two-way relay (TWR) channels. Existing partial decoding realizations are however designed for Gaussian channels and with a static physical layer…

Information Theory · Computer Science 2016-11-15 Jianquan Liu , Meixia Tao , Youyun Xu

We propose an approximation of maximum-likelihood detection in ISI channels based on linear programming or message passing. We convert the detection problem into a binary decoding problem, which can be easily combined with LDPC decoding. We…

Information Theory · Computer Science 2016-11-18 Mohammad H. Taghavi , Paul H. Siegel

In this paper, we present an improved union bound on the Linear Programming (LP) decoding performance of the binary linear codes transmitted over an additive white Gaussian noise channels. The bounding technique is based on the second-order…

Information Theory · Computer Science 2012-03-09 Ohad Gidon , Yair Be'ery

The code that combines channel estimation and error protection has received general attention recently, and has been considered a promising methodology to compensate multi-path fading effect. It has been shown by simulations that such code…

Information Theory · Computer Science 2007-12-18 Chia-Lung Wu , Po-Ning Chen , Yunghsiang S. Han , Ming-Hsin Kuo

We present a mathematical connection between channel coding and compressed sensing. In particular, we link, on the one hand, \emph{channel coding linear programming decoding (CC-LPD)}, which is a well-known relaxation o maximum-likelihood…

Information Theory · Computer Science 2016-11-17 Alexandros G. Dimakis , Roxana Smarandache , Pascal O. Vontobel

We formulate maximum likelihood (ML) channel decoding as a quadratic unconstraint binary optimization (QUBO) and simulate the decoding by the current commercial quantum annealing machine, D-Wave 2000Q. We prepared two implementations with…

Information Theory · Computer Science 2020-10-06 Naoki Ide , Tetsuya Asayama , Hiroshi Ueno , Masayuki Ohzeki

Consider a receiver in a multi-user network that wishes to decode several messages. Simultaneous joint typicality decoding is one of the most powerful techniques for determining the fundamental limits at which reliable decoding is possible.…

Information Theory · Computer Science 2019-01-11 Sung Hoon Lim , Chen Feng , Adriano Pastore , Bobak Nazer , Michael Gastpar

We discuss the performance of Low-Density-Parity-Check (LDPC) codes decoded by means of Linear Programming (LP) at moderate and large Signal-to-Noise-Ratios (SNR). Utilizing a combination of the previously introduced pseudo-codeword-search…

Information Theory · Computer Science 2007-07-13 Michael Chertkov , Mikhail Stepanov

Linear Programming (LP) decoding is emerging as an attractive alternative to decode Low-Density Parity-Check (LDPC) codes. However, the earliest LP decoders proposed for binary and nonbinary LDPC codes are not suitable for use at moderate…

Information Theory · Computer Science 2011-02-17 Mayur Punekar , Mark F. Flanagan

In this paper, we use a linear programming (LP) optimization approach to evaluate the equivocation for a wiretap channel where the main channel is noiseless, and the wiretap channel is a binary symmetric channel (BSC). Using this technique,…

Information Theory · Computer Science 2024-01-17 Ali Nikkhah , Morteza Shoushtari , Bahareh Akhbari , Willie K. Harrison

We present and study linear programming based detectors for two-dimensional intersymbol interference channels. Interesting instances of two-dimensional intersymbol interference channels are magnetic storage, optical storage and Wyner's…

Information Theory · Computer Science 2011-03-01 Shrinivas Kudekar , Jason K. Johnson , Michael Chertkov