English
Related papers

Related papers: A Finite-Length Construction of Irregular Spatiall…

200 papers

In this paper, we propose new coupled codes constructed by overlapping circular spatially-coupled low-density parity-check (SC-LDPC) codes, which show better asymptotic and finite-length decoding performance compared to the conventional…

Information Theory · Computer Science 2018-03-28 Heeyoul Kwak , Bohwan Jun , Pilwoong Yang , Jong-Seon No , Dong-Joon Shin

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

Spatially-coupled (SC) codes are a family of graph-based codes that have attracted significant attention thanks to their capacity approaching performance and low decoding latency. An SC code is constructed by partitioning an underlying…

Information Theory · Computer Science 2018-02-20 Homa Esfahanizadeh , Ahmed Hareedy , Lara Dolecek

Spatially-Coupled (SC)-LDPC codes are known to have outstanding error-correction performance and low decoding latency. Whereas previous works on LDPC and SC-LDPC codes mostly take either an asymptotic or a finite-length design approach, in…

Information Theory · Computer Science 2022-09-02 Homa Esfahanizadeh , Eshed Ram , Yuval Cassuto , Lara Dolecek

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

SC-LDPC codes with sub-block locality can be decoded locally at the level of sub-blocks that are much smaller than the full code block, thus providing fast access to the coded information. The same code can also be decoded globally using…

Information Theory · Computer Science 2020-05-28 Homa Esfahanizadeh , Eshed Ram , Yuval Cassuto , Lara Dolecek

In this paper, we analyze the finite-length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains. Successive (peeling) decoding is considered for the binary erasure…

Information Theory · Computer Science 2014-03-03 Pablo M. Olmos , David G. M. Mitchell , Dmitri Truhachev , Daniel J. Costello

A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are described by protographs, comprised of several protograph-based chains characterizing individual…

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

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

In this paper, we propose to study and optimize a very general class of LDPC codes whose variable nodes belong to finite sets with different orders. We named this class of codes Hybrid LDPC codes. Although efficient optimization techniques…

Information Theory · Computer Science 2007-07-16 Lucile Sassatelli , David Declercq

Codes constructed from connected spatially coupled low-density parity-check code (SC-LDPCC) chains are proposed and analyzed. It is demonstrated that connecting coupled chains results in improved iterative decoding performance. The…

Information Theory · Computer Science 2012-08-27 Dmitri Truhachev , David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello,

The concept of spatial coupling is among the most significant breakthroughs in coding theory over the past decade. The excellent waterfall and error floor performance of spatially coupled codes has positioned them as promising coding…

Information Theory · Computer Science 2026-05-13 Min Qiu , Xiaowei Wu , Peng Kang , Lei Yang , Jinhong Yuan

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

Spatially-coupled (SC) codes are a class of low-density parity-check (LDPC) codes that have excellent performance thanks to the degrees of freedom they offer. An SC code is designed by partitioning a base matrix into components, the number…

Information Theory · Computer Science 2026-05-11 Bade Aksoy , Doğukan Özbayrak , Ahmed Hareedy

This paper investigates the design of self-connected spatially coupled low-density parity-check (SC-LDPC) codes. First, a termination method is proposed to reduce rate loss. Particularly, a single-side open SC-LDPC ensemble is introduced,…

Information Theory · Computer Science 2023-07-03 Yihuan Liao , Min Qiu , Jinhong Yuan

Because of their excellent asymptotic and finite-length performance, spatially-coupled (SC) codes are a class of low-density parity-check codes that is gaining increasing attention. Multi-dimensional (MD) SC codes are constructed by…

Information Theory · Computer Science 2025-10-08 Canberk İrimağzı , Ata Tanrıkulu , Ahmed Hareedy

Spatially-coupled LDPC codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially-coupled…

Information Theory · Computer Science 2015-05-26 Pablo M. Olmos , Rüdiger Urbanke

We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing…

Information Theory · Computer Science 2019-07-09 Laurent Schmalen , Vahid Aref

In this paper, we propose a non-uniform windowed decoder for multi-dimensional spatially-coupled LDPC (MD-SC-LDPC) codes over the binary erasure channel. An MD-SC-LDPC code is constructed by connecting together several SC-LDPC codes into…

Information Theory · Computer Science 2020-05-13 Lev Tauz , Homa Esfahanizadeh , Lara Dolecek

A new type of spatially coupled low-density parity-check (SC-LDPC) codes motivated by practical storage applications is presented. SC-LDPCL codes (suffix 'L' stands for locality) can be decoded locally at the level of sub-blocks that are…

Information Theory · Computer Science 2020-09-29 Eshed Ram , Yuval Cassuto
‹ Prev 1 2 3 10 Next ›