English
Related papers

Related papers: Threshold Improvement of Low-Density Lattice Codes…

200 papers

We consider spatially coupled code ensembles. A particular instance are convolutional LDPC ensembles. It was recently shown that, for transmission over the memoryless binary erasure channel, this coupling increases the belief propagation…

Information Theory · Computer Science 2011-02-03 Shrinivas Kudekar , Kenta Kasai

We investigate the effect of structural distortion on bond percolation in simple cubic and body-centered cubic lattices using extensive Monte Carlo simulations. Distortion is introduced through controlled random displacements of lattice…

Statistical Mechanics · Physics 2026-02-18 Bishnu Bhowmik , Sayantan Mitra , Robert M. Ziff , Ankur Sensharma

Ultra-reliable low latency communication (URLLC) is a key part of 5G wireless systems. Achieving low latency necessitates codes with short blocklengths for which polar codes with successive cancellation list (SCL) decoding typically…

Hardware Architecture · Computer Science 2025-12-22 Darja Nonaca , Jérémy Guichemerre , Reinhard Wiesmayr , Nihat Engin Tunali , Christoph Studer

This paper is concerned with the design of capacity approaching ensembles of Low-Densiy Parity-Check (LDPC) codes for correlated sources. We consider correlated binary sources where the data is encoded independently at each source through a…

Information Theory · Computer Science 2017-01-30 Mohamad Khas Mohamadi , Hamid Saeedi , Reza Asvadi

We propose a novel encoding/transmission scheme called continuous chain (CC) transmission that is able to improve the finite-length performance of a system using spatially-coupled low-density parity-check (SC-LDPC) codes. In CC…

Information Theory · Computer Science 2019-10-04 Pablo M. Olmos , David G. M. Mitchell , Dmitri Truhachev , Daniel J. Costello

Quantum low density parity check (qLDPC) codes are an attractive alternative to the surface code due to their relatively high code rate and distance. However, unlike the surface code which has simple, geometrically local, stabilizer checks,…

Quantum Physics · Physics 2025-09-17 Omprakash Chandra , Gopikrishnan Muraleedharan , Gavin K. Brennen

Although power line communication (PLC) systems are available everywhere, unfortunately these systems are not suitable for information transmission due to the effects of the impulsive noise. Therefore, many previous studies on channel codes…

Signal Processing · Electrical Eng. & Systems 2020-07-08 Ammar Hadi , Emad Alsusa , Khaled M. Rabie

We present an analytic method of assessing the typical performance of low-density parity-check codes on finite-state Markov channels. We show that this problem is similar to a spin-glass model on a `small-world' lattice. We apply our…

Disordered Systems and Neural Networks · Physics 2014-09-23 I. Neri , N. S. Skantzos

This paper examines the construction of low-density parity-check (LDPC) codes from transversal designs based on sets of mutually orthogonal Latin squares (MOLS). By transferring the concept of configurations in combinatorial designs to the…

Information Theory · Computer Science 2018-07-03 Alexander Gruner , Michael Huber

We investigate the minimum distance of structured binary Low-Density Parity-Check (LDPC) codes whose parity-check matrices are of the form $[\mathbf{C} \vert \mathbf{M}]$ where $\mathbf{C}$ is circulant and of column weight $2$, and…

Information Theory · Computer Science 2025-02-03 François Arnault , Philippe Gaborit , Wouter Rozendaal , Nicolas Saussay , Gilles Zémor

We study a new encoding scheme for lossy source compression based on spatially coupled low-density generator-matrix codes. We develop a belief-propagation guided-decimation algorithm, and show that this algorithm allows to approach the…

Information Theory · Computer Science 2012-02-23 Vahid Aref , Nicolas Macris , Rudiger Urbanke , Marc Vuffray

In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity $\frac{1}{2}\log(1+\SNR)$ of the additive white Gaussian-noise (AWGN) channel. Our construction follows the…

Information Theory · Computer Science 2018-10-16 Ling Liu , Yanfei Yan , Cong Ling , Xiaofu Wu

We consider a special family of SC-LDPC codes, that is, time-invariant LDPCC codes, which are known in the literature for a long time. Codes of this kind are usually designed by starting from QC block codes, and applying suitable unwrapping…

Information Theory · Computer Science 2016-05-19 Marco Baldi , Massimo Battaglioni , Franco Chiaraluce , Giovanni Cancellieri

In this paper, we study the application of spatially coupled LDPC codes with sub-block locality for space division multiplexing. We focus on the information exchange between the sub-blocks and compare decoding strategies with respect to the…

Information Theory · Computer Science 2023-10-25 Haizheng Li , Laurent Schmalen

Families of "asymptotically regular" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles…

Information Theory · Computer Science 2015-03-17 Michael Lentmaier , David G. M. Mitchell , Gerhard P. Fettweis , Daniel J. Costello,

This paper basically expresses the core fundamentals and brief overview of the research of R. G. GALLAGER [1] on Low-Density Parity-Check (LDPC) codes and various parameters related to LDPC codes like, encoding and decoding of LDPC codes,…

Information Theory · Computer Science 2020-09-21 Saumya Borwankar , Dhruv Shah

Protograph-based, off-the-shelf low-density parity-check (LDPC) codes are optimized for higher-order modulation and quantized sum-product decoders. As an example, for the recently proposed LDPC code from the upcoming IEEE 802.3ca standard…

Information Theory · Computer Science 2018-10-02 Fabian Steiner , Gerhard Kramer

We present constructions of Space-Time (ST) codes based on lattice coset coding. First, we focus on ST code constructions for the short block-length case, i.e., when the block-length is equal to or slightly larger than the number of…

Information Theory · Computer Science 2008-04-14 K. Raj Kumar , Giuseppe Caire

Linear nested codes, where two or more sub-codes are nested in a global code, have been proposed as candidates for reliable multi-terminal communication. In this paper, we consider nested array-based spatially coupled low-density…

Information Theory · Computer Science 2021-02-23 Salman Habib , David G. M. Mitchell , Joerg Kliewer

In this paper, we propose a new method to design low-density parity-check Hadamard (LDPC-Hadamard) codes, a type of ultimate-Shannon-limit approaching channel codes. The technique is based on applying Hadamard constraints to the check nodes…

Information Theory · Computer Science 2021-01-06 Peng W. Zhang , Francis C. M. Lau , Chiu-W. Sham