English
Related papers

Related papers: Spatially-Coupled MacKay-Neal Codes and Hsu-Anasta…

200 papers

This paper is concerned with a class of low density generator matrix codes (LDGM), called repetition and superposition (RaS) codes, which have been proved to be capacity-achieving over binary-input output-symmetric (BIOS) channels in terms…

Information Theory · Computer Science 2024-02-22 Yixin Wang , Xiao Ma

A non-adaptive quantitative group testing (GT) scheme based on sparse codes-on-graphs in combination with low-complexity peeling decoding was introduced and analyzed by Karimi et al.. In this work, we propose a variant of this scheme based…

Information Theory · Computer Science 2024-04-18 Mgeni Makambi Mashauri , Alexandre Graell i Amat , Michael Lentmaier

Spatially coupled low-density parity-check (SC-LDPC) codes are a class of capacity approaching LDPC codes with low message recovery latency when a sliding window decoding is used. In this paper, we first present a new method for the…

Information Theory · Computer Science 2023-10-20 Zeinab Roostaie , Mohammad Gholami , Farzad Parvaresh

A circulant-based spatially-coupled (SC) code is constructed by partitioning the circulants in the parity-check matrix of a block code into several components and piecing copies of these components in a diagonal structure. By connecting…

Information Theory · Computer Science 2019-08-08 Homa Esfahanizadeh , Lev Tauz , Lara Dolecek

We apply several state-of-the-art techniques developed in recent advances of counting algorithms and statistical physics to study the spatial mixing property of the two-dimensional codes arising from local hard (independent set)…

Information Theory · Computer Science 2014-02-26 Yi-Kai Wang , Yitong Yin , Sheng Zhong

In this paper, we study a new class of high-rate spatially coupled LDPC (SC-LDPC) codes based on the convolutional self-orthogonal codes (CSOCs) first introduced by Massey. The SC-LDPC codes are constructed by treating the irregular graph…

Information Theory · Computer Science 2025-02-18 Daniel J. Costello, , Min Zhu , David G. M. Mitchell , Michael Lentmaier

In this work, we give good concatenated code ensembles for the binary erasure channel (BEC). In particular, we consider repeat multiple-accumulate (RMA) code ensembles formed by the serial concatenation of a repetition code with multiple…

Information Theory · Computer Science 2011-05-31 Alexandre Graell i Amat , Eirik Rosnes

An ensemble of LDPC convolutional codes with parity-check matrices composed of permutation matrices is considered. The convergence of the iterative belief propagation based decoder for terminated convolutional codes in the ensemble is…

Information Theory · Computer Science 2016-11-17 Michael Lentmaier , Arvind Sridharan , Kamil Sh. Zigangirov , Daniel J. Costello

For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using Ramanujan graphs. When the DDP has minimum left degree at…

Information Theory · Computer Science 2016-11-17 Arunkumar Subramanian , Andrew Thangaraj , Matthieu Bloch , Steven W. McLaughlin

Protograph low-density-parity-check (LDPC) are considered to design near-capacity low-rate codes over the binary erasure channel (BEC) and binary additive white Gaussian noise (BIAWGN) channel. For protographs with degree-one variable nodes…

Information Theory · Computer Science 2018-05-03 Asit Kumar Pradhan , Andrew Thangaraj

Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of…

Information Theory · Computer Science 2016-11-18 David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

In this paper, we have investigated the application of non-binary LDPC codes to spatial multiplexing MIMO systems with a large number of low power antennas. We demonstrate that such large MIMO systems incorporating with low-complexity MMSE…

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

We study spatially coupled LDPC codes that allow access to sub-blocks much smaller than the full code block. Sub-block access is realized by a semi-global decoder that decodes a chosen target sub-block by only accessing the target, plus a…

Information Theory · Computer Science 2020-10-22 Eshed Ram , Yuval Cassuto

Spatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications and data storage systems. SC codes are constructed by partitioning an…

Information Theory · Computer Science 2021-09-21 Siyi Yang , Ahmed Hareedy , Robert Calderbank , Lara Dolecek

Because of their capacity-approaching performance, graph-based codes have a wide range of applications, including communications and storage. In these codes, unequal error protection (UEP) can offer performance gains with limited rate loss.…

Information Theory · Computer Science 2021-01-25 Beyza Dabak , Ahmed Hareedy , Alexei Ashikhmin , Robert Calderbank

A multilevel coded modulation scheme is studied that uses solely binary polar codes and Honda-Yamamoto probabilistic shaping. The scheme is shown to achieve the capacity of discrete memoryless channels with input alphabets of cardinality a…

Information Theory · Computer Science 2022-08-11 Constantin Runge , Thomas Wiegart , Diego Lentner , Tobias Prinz

Using the spatial modulation approach, where only one transmit antenna is active at a time, we propose two transmission schemes for two-way relay channel using physical layer network coding with space time coding using Coordinate…

Information Theory · Computer Science 2014-01-07 K. G. Unnikrishnan , B. Sundar Rajan

Spatial coupling is utilized to improve the performance of iterative channel estimation, multiuser detection, and decoding for multiple-input multiple-input (MIMO) bit-interleaved coded modulation (BICM). Coupling is applied to both coding…

Information Theory · Computer Science 2014-12-22 Keigo Takeuchi

Since the classical work of Berlekamp, McEliece and van Tilborg, it is well known that the problem of exact maximum-likelihood (ML) decoding of general linear codes is NP-hard. In this paper, we show that exact ML decoding of a classs of…

Information Theory · Computer Science 2016-11-17 Weiyu Xu , Babak Hassibi

The past decade has seen notable advances in our understanding of structured error-correcting codes, particularly binary Reed--Muller (RM) codes. While initial breakthroughs were for erasure channels based on symmetry, extending these…

Information Theory · Computer Science 2025-04-23 Henry D. Pfister , Galen Reeves