English
Related papers

Related papers: Analysis of Non-binary Hybrid LDPC Codes

200 papers

We investigate the reasons behind the superior performance of belief propagation decoding of non-binary LDPC codes over their binary images when the transmission occurs over the binary erasure channel. We show that although decoding over…

Information Theory · Computer Science 2016-11-15 Aman Bhatia , Aravind R. Iyengar , Paul H. Siegel

We study classical and quantum LDPC codes of constant rate obtained by the lifted product construction over non-abelian groups. We show that the obtained families of quantum LDPC codes are asymptotically good, which proves the qLDPC…

Information Theory · Computer Science 2022-01-24 Pavel Panteleev , Gleb Kalachev

Density evolution for protograph Low-Density Parity-Check (LDPC) codes is considered, and it is shown that the message-error rate falls double-exponentially with iterations whenever the degree-2 subgraph of the protograph is cycle-free and…

Information Theory · Computer Science 2016-11-18 Asit Kumar Pradhan , Andrew Thangaraj , Arunkumar Subramanian

This paper is concerned with linear superposition systems in which all components of the superimposed signal are coded with an identical binary low-density parity-check (LDPC) code.

Information Theory · Computer Science 2019-09-23 Shancheng Zhao , Xiao Ma , Baoming Bai

Quantum codes with low-weight stabilizers known as LDPC codes have been actively studied recently due to their simple syndrome readout circuits and potential applications in fault-tolerant quantum computing. However, all families of quantum…

Quantum Physics · Physics 2014-10-20 Sergey Bravyi , Matthew B. Hastings

We analyze nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group for transmission over the binary erasure channel. We prove threshold saturation of the belief propagation decoding to the…

Information Theory · Computer Science 2014-07-23 Alexandre Graell i Amat , Iryna Andriyanova , Amina Piemontese

We address the problem of constructing of coding schemes for the channels with high-order modulations. It is known, that non-binary LDPC codes are especially good for such channels and significantly outperform their binary counterparts.…

Information Theory · Computer Science 2017-02-09 Valeriya Potapova , Alexey Frolov

Low-density parity check (LDPC) codes are an important class of codes with many applications. Two algebraic methods for constructing regular LDPC codes are derived -- one based on nonprimitive narrow-sense BCH codes and the other directly…

Information Theory · Computer Science 2008-02-28 Salah A. Aly

In this paper, we propose a new design method of irregular spatially-coupled low-density parity-check (SC-LDPC) codes with non-uniform degree distributions by linear programming (LP). In general, irregular SC-LDPC codes with non-uniform…

Information Theory · Computer Science 2018-03-28 Heeyoul Kwak , Jong-Seon No , Hosung Park

Based on the extended binary image of non-binary LDPC codes, we propose a method for generating extra redundant bits, such as to decreases the coding rate of a mother code. The proposed method allows for using the same decoder, regardless…

Information Theory · Computer Science 2011-03-15 Lam Pham Sy , Valentin Savin , David Declercq

In this paper, the application of non-binary low-density parity-check (NBLDPC) codes to MIMO systems which employ hundreds of antennas at both the transmitter and the receiver has been proposed. Together with the well-known low-complexity…

Information Theory · Computer Science 2012-11-22 Puripong Suthisopapan , Kenta Kasai , Anupap Meesomboon , Virasit Imtawil

Density evolution (DE) is one of the most powerful analytical tools for low-density parity-check (LDPC) codes on memoryless binary-input/symmetric-output channels. The case of non-symmetric channels is tackled either by the LDPC coset code…

Information Theory · Computer Science 2007-07-13 Chih-Chun Wang , H. Vincent Poor , Sanjeev R. Kulkarni

Generalized low-density parity-check (GLDPC) codes are a class of LDPC codes in which the standard single parity check (SPC) constraints are replaced by constraints defined by a linear block code. These stronger constraints typically result…

Information Theory · Computer Science 2021-04-19 David G. M. Mitchell , Pablo M. Olmos , Michael Lentmaier , Daniel J. Costello

In the literatures, it is well-known that Fossorier code has the girth among LDPC codes. In this paper, we introduce a new class of low-density parity-check (LDPC) codes, with higher girth than other previous constructed codes. Especially…

Information Theory · Computer Science 2016-11-25 Mehdi samadieh , Mohammad Gholami

Hybrid codes simultaneously encode both quantum and classical information, allowing for the transmission of both across a quantum channel. We construct a family of nonbinary error-detecting hybrid stabilizer codes that can detect one error…

Quantum Physics · Physics 2020-02-26 Andrew Nemec , Andreas Klappenecker

By presenting an approximated performance-complexity tradeoff (PCT) algorithm,a low-complexity non-binary low density parity check (LDPC) code over q-ary-input symmetric-output channel is designed in this manuscript which converges faster…

Signal Processing · Electrical Eng. & Systems 2020-03-03 Yang Yu , Wen Chen

Irregular low-density parity check (LDPC) codes are particularly well-suited for transmission schemes that require unequal error protection (UEP) of the transmitted data due to the different connection degrees of its variable nodes.…

Information Theory · Computer Science 2011-02-01 H. V. Beltrao Neto , W. Henkel , V. C. da Rocha

We study LDPC codes for the channel with input ${x}\in \mathbb{F}_q^m$ and output ${y}={x}+{z}\in \mathbb{F}_q^m$. The aim of this paper is to evaluate decoding performance of $q^m$-ary non-binary LDPC codes for large $m$. We give density…

Information Theory · Computer Science 2014-01-29 Koji Tazoe , Kenta Kasai , Kohichi Sakaniwa

A decoding algorithm for $q$-ary low-density parity-check codes over the $q$-ary symmetric channel is introduced. The exchanged messages are lists of symbols from $\Fq$. A density evolution analysis for maximum list sizes $1$ and $2$ is…

Information Theory · Computer Science 2021-04-14 Emna Ben Yacoub

Recently, a novel lookup table based decoding method for binary low-density parity-check codes has attracted considerable attention. In this approach, mutual-information maximizing lookup tables replace the conventional operations of the…

Information Theory · Computer Science 2019-10-24 Maximilian Stark , Jan Lewandowsky , Souradip Saha , Gerhard Bauch