English
Related papers

Related papers: New Codes on Graphs Constructed by Connecting Spat…

200 papers

We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff and efficient list decoding up to the Johnson bound in polynomial time. Previous constructions of list decodable good distance…

Information Theory · Computer Science 2024-11-08 Thiago Bergamaschi , Fernando Granha Jeronimo , Tushant Mittal , Shashank Srivastava , Madhur Tulsiani

A generalized low-density parity-check (GLDPC) code is a class of codes, where single parity check nodes in a conventional low-density parity-check (LDPC) code are replaced by linear codes with higher parity check constraints. In this…

Information Theory · Computer Science 2022-09-07 Jaewha Kim , Jae-Won Kim , Hee-Youl Kwak , Jong-Seon No

The design of low-density parity-check (LDPC) code ensembles optimized for a finite number of decoder iterations is investigated. Our approach employs EXIT chart analysis and differential evolution to design such ensembles for the binary…

Information Theory · Computer Science 2016-11-17 Ian P. Mulholland , Enrico Paolini , Mark F. Flanagan

A simple and general definition of quasi cyclic low density parity check (QC LDPC) codes which are constructed based on circulant permutation matrices (CPM) is proposed. As an special case of this definition, we first represent one type of…

Information Theory · Computer Science 2017-01-24 A. Tasdighi , M. R. Sadeghi

This paper presents several new construction techniques for low-density parity-check (LDPC) and systematic repeat-accumulate (RA) codes. Based on specific classes of combinatorial designs, the improved code design focuses on high-rate…

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

A novel method guaranteeing nondecreasing girth is presented for constructing longer low-density parity-check (LDPC) codes from shorter ones. The parity-check matrix of a shorter base code is decomposed into N (N>=2) non-overlapping…

Information Theory · Computer Science 2018-01-29 Guohua Zhang , Yulin Hu , Qinwei He

Low-density parity-check (LDPC) convolutional codes have been shown to exhibit excellent performance under low-complexity belief-propagation decoding [1], [2]. This phenomenon is now termed threshold saturation via spatial coupling. The…

Information Theory · Computer Science 2013-12-30 Santhosh Kumar , Andrew J. Young , Nicolas Macris , Henry D. Pfister

In this paper we study the iterative decoding threshold performance of non-binary spatially-coupled low-density parity-check (NB-SC-LDPC) code ensembles for both the binary erasure channel (BEC) and the binary-input additive white Gaussian…

Information Theory · Computer Science 2016-11-18 Lai Wei , Toshiaki Koike-Akino , David G. M. Mitchell , Thomas E. Fuja , Daniel J. Costello

In this paper, we highlight the class of spatially coupled codes and discuss their applicability to long-haul and submarine optical communication systems. We first demonstrate how to optimize irregular spatially coupled LDPC codes for their…

Information Theory · Computer Science 2016-06-03 Laurent Schmalen , Detlef Suikat , Detlef Rösener , Vahid Aref , Andreas Leven , Stephan ten Brink

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

Forward error correcting (FEC) codes are used in many communication standards with a wide range of re quirements. FEC codes should work close to capacity, achieve low error floors, and have low decoding complexity. In this paper, we propose…

Information Theory · Computer Science 2025-05-26 Vincent Wüst , Erdem Eray Cil , Laurent Schmalen

Joint encryption-encoding schemes have been released to fulfill both reliability and security desires in a single step. Using Low Density Parity Check (LDPC) codes in joint encryption-encoding schemes, as an alternative to classical linear…

Information Theory · Computer Science 2019-02-22 Hossein Khayami , Taraneh Eghlidos , Mohammad Reza Aref

Since the discovery of turbo codes 20 years ago and the subsequent re-discovery of low-density parity-check codes a few years later, the field of channel coding has experienced a number of major advances. Up until that time, code designers…

Information Theory · Computer Science 2016-11-17 Daniel J. Costello, , Lara Dolecek , Thomas E. Fuja , Joerg Kliewer , David G. M. Mitchell , Roxana Smarandache

A protograph-based low-density parity-check (LDPC) code design technique for bandwidth-efficient coded modulation is presented. The approach jointly optimizes the LDPC code node degrees and the mapping of the coded bits to the…

Information Theory · Computer Science 2015-01-23 Fabian Steiner , Georg Böcherer , Gianluigi Liva

For finite coupling lengths, terminated spatially coupled low-density parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in conjunction…

Information Theory · Computer Science 2017-04-19 Sebastian Cammerer , Laurent Schmalen , Vahid Aref , Stephan ten Brink

In this paper we propose the construction of Spatially Coupled Low-Density Parity-Check (SC-LDPC) codes using a periodic time-variant Quasi-Cyclic (QC) algorithm. The QC based approach is optimized to obtain memory efficiency in storing the…

Information Theory · Computer Science 2013-10-18 Vikram Arkalgud Chandrasetty , Sarah J. Johnson , Gottfried Lechner

Spatially coupled low-density parity-check (SC-LDPC) codes can achieve the channel capacity under low-complexity belief propagation (BP) decoding, however, there is a non-negligible rate-loss because of termination effects for practical…

Information Theory · Computer Science 2015-12-16 Sebastian Cammerer , Vahid Aref , Laurent Schmalen , Stephan ten Brink

In this work, the design of robust, protograph-based low-density parity-check (LDPC) codes for rate-adaptive communication via probabilistic shaping is considered. Recently, probabilistic amplitude shaping (PAS) by B\"ocherer et al. has…

Information Theory · Computer Science 2016-07-04 Fabian Steiner , Patrick Schulte

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

Spatially-coupled (SC) codes are a class of low-density parity-check (LDPC) codes that is gaining increasing attention. Multi-dimensional (MD) SC codes are constructed by connecting copies of an SC code via relocations in order to mitigate…

Information Theory · Computer Science 2026-03-30 Ata Tanrıkulu , Mete Yıldırım , Ahmed Hareedy