pith. machine review for the scientific record. sign in

arxiv: 2605.11542 · v1 · submitted 2026-05-12 · 💻 cs.IT · eess.SP· math.IT

Recognition: 2 theorem links

· Lean Theorem

Recent Advances in Spatially Coupled Codes: Overview and Outlook

Min Qiu , Xiaowei Wu , Peng Kang , Lei Yang , Jinhong Yuan
Authors on Pith no claims yet

Pith reviewed 2026-05-13 01:33 UTC · model grok-4.3

classification 💻 cs.IT eess.SPmath.IT
keywords spatially coupled codescoding theoryerror correctionwaterfall performanceerror floorcommunication systemsdata storage
0
0 comments X

The pith

Spatially coupled codes exhibit excellent waterfall and error floor performance that positions them as promising candidates for future communication and data storage systems.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper reviews recent advances in spatially coupled codes by examining several representative constructions and their distinctive features for different applications. It explains the useful properties of these codes and outlines approaches to designing effective versions. This establishes spatial coupling as a significant development in coding theory. The review ends by identifying future research directions and open problems that could expand their use.

Core claim

The concept of spatial coupling is among the most significant breakthroughs in coding theory over the past decade. Spatially coupled codes deliver excellent waterfall and error floor performance, which has positioned them as promising coding candidates for future communication and data storage systems. The paper reviews representative recent constructions, highlights their unique features, discusses their properties and design methods, and concludes with future directions and open problems.

What carries the argument

Spatial coupling, the mechanism that links code components across space to achieve improved threshold behavior and error performance.

If this is right

  • Codes can be customized with unique features to suit specific needs in wireless communications or flash memory storage.
  • Property-based design methods produce constructions with reliable decoding behavior.
  • Identified open problems guide targeted improvements that could broaden adoption.
  • The codes' performance profile supports higher reliability in systems handling large data volumes.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The review leaves room to explore how spatial coupling interacts with modern iterative decoders in hardware-constrained environments.
  • Open problems may link to questions about scaling these codes for very high-speed applications not yet tested at scale.
  • Further work could test whether the reviewed constructions maintain advantages when combined with non-binary alphabets or irregular structures.

Load-bearing premise

The performance advantages reported for the reviewed codes in prior literature hold up in practical deployments across the mentioned applications.

What would settle it

A side-by-side comparison in a real communication or storage system where spatially coupled codes show no meaningful improvement in error rates compared to standard uncoupled codes under equivalent conditions.

Figures

Figures reproduced from arXiv: 2605.11542 by Jinhong Yuan, Lei Yang, Min Qiu, Peng Kang, Xiaowei Wu.

Figure 1
Figure 1. Figure 1: General structure of spatially coupled codes. For a coupling memory [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: (a) An uncoupled protograph for BBC = [3 3], representing a (3, 6)- regular LDPC block code. (b) The spatially coupled chain of protographs across time instants, with an illustration of a sliding window decoder of size W = 4. (c) The base matrix of a time-invariant SC-LDPC protograph with coupling length L. (d) The SC-LDPC protograph with L = 5 and m = 2. ⊞ denotes a CN and • denotes a VN in the protograph… view at source ↗
Figure 4
Figure 4. Figure 4: Block diagram of an SC-SCC encoder with rate- [PITH_FULL_IMAGE:figures/full_fig_p004_4.png] view at source ↗
Figure 3
Figure 3. Figure 3: Block diagram of (a) a PR-PCC encoder and (b) a GSC-PCC encoder [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 5
Figure 5. Figure 5: Block diagram of an HSC-BCC encoder with rate- [PITH_FULL_IMAGE:figures/full_fig_p005_5.png] view at source ↗
Figure 7
Figure 7. Figure 7: Base matrix and design matrix of an SC-SPARC. [PITH_FULL_IMAGE:figures/full_fig_p006_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Connected chain ensemble constructed from two [PITH_FULL_IMAGE:figures/full_fig_p007_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Waterfall performance of SC-LDPC codes with [PITH_FULL_IMAGE:figures/full_fig_p013_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Error floor performance of SC-LDPC codes with [PITH_FULL_IMAGE:figures/full_fig_p013_10.png] view at source ↗
read the original abstract

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 candidates for future communication and data storage systems. This article presents an overview of recent advances in spatially coupled codes. In particular, we first review several representative examples of recently proposed spatially coupled codes and highlight their unique features that make them appealing for different applications. Next, we discuss the useful properties of spatially coupled codes and how to design good spatially coupled codes. The article concludes with some future research directions and open problems.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript is an overview of recent advances in spatially coupled codes. It reviews several representative examples of recently proposed spatially coupled codes and highlights their unique features for different applications, discusses the useful properties of these codes and approaches to designing good ones, and concludes with future research directions and open problems. The central positioning is that the excellent waterfall and error floor performance of spatially coupled codes has made them promising candidates for future communication and data storage systems.

Significance. If the synthesis accurately captures the cited literature without selection bias, the survey would be a useful consolidating reference for the coding theory community. It organizes key constructions, properties, and open issues around a recognized breakthrough in the field, potentially helping researchers navigate the literature and identify directions for work. The paper itself advances no new theorems, simulations, or bounds but relies on prior results for its performance claims.

minor comments (3)
  1. The abstract and review section should briefly state the criteria used to select the 'representative examples' of spatially coupled codes, to allow readers to assess whether the highlighted performance features are broadly representative or emphasize particularly favorable cases.
  2. Adding a summary table or figure comparing key performance metrics (e.g., waterfall thresholds, error floors) across the reviewed constructions and applications would improve clarity and make the claims easier to evaluate at a glance.
  3. In the discussion of design methods and properties, ensure that any referenced performance figures from prior work are accompanied by explicit citations to the specific results or figures being summarized, to facilitate verification.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our overview manuscript and for recommending minor revision. We are pleased that the synthesis is viewed as potentially useful for the coding theory community if it accurately reflects the literature.

Circularity Check

0 steps flagged

No significant circularity

full rationale

This is a review/overview paper that synthesizes prior literature on spatially coupled codes, their constructions, properties, and applications. It advances no new theorems, equations, simulations, performance bounds, or predictions. All performance claims and features are explicitly drawn from external cited works rather than derived internally. No load-bearing steps reduce by definition, fitting, or self-citation chain to the paper's own inputs. The manuscript is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

This is a survey paper; the overview rests on the accuracy of the cited literature rather than new mathematical axioms, free parameters, or invented entities.

pith-pipeline@v0.9.0 · 5400 in / 899 out tokens · 27065 ms · 2026-05-13T01:33:05.070966+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

62 extracted references · 62 canonical work pages

  1. [1]

    Time-varying periodic convolutional codes with low-density parity-check matrix,

    A. Jimenez Felstrom and K. S. Zigangirov, “Time-varying periodic convolutional codes with low-density parity-check matrix,”IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2181–2191, Sep. 1999

    work page 1999

  2. [2]

    Iter- ative decoding threshold analysis for LDPC convolutional codes,

    M. Lentmaier, A. Sridharan, D. J. Costello, and K. S. Zigangirov, “Iter- ative decoding threshold analysis for LDPC convolutional codes,”IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 5274–5289, Oct. 2010. IEEE BITS THE INFORMATION THEORY MAGAZINE 15

    work page 2010

  3. [3]

    Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC,

    S. Kudekar, T. J. Richardson, and R. L. Urbanke, “Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC,”IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 803– 834, Feb. 2011

    work page 2011

  4. [4]

    Staircase codes: FEC for 100 Gb/s OTN,

    B. P. Smith, A. Farhood, A. Hunt, F. R. Kschischang, and J. Lodge, “Staircase codes: FEC for 100 Gb/s OTN,”J. Lightw. Technol., vol. 30, no. 1, pp. 110–117, Jan. 2012

    work page 2012

  5. [5]

    Optical Internetworking Forum (OIF),Implementation Agreement 400ZR, OIF-400ZR-02.0, Jul. 2022

    work page 2022

  6. [6]

    Threshold satura- tion for spatially coupled LDPC and LDGM codes on BMS channels,

    S. Kumar, A. J. Young, N. Macris, and H. D. Pfister, “Threshold satura- tion for spatially coupled LDPC and LDGM codes on BMS channels,” IEEE Trans. Inf. Theory, vol. 60, no. 12, pp. 7389–7415, 2014

    work page 2014

  7. [7]

    Spatially coupled en- sembles universally achieve capacity under belief propagation,

    S. Kudekar, T. Richardson, and R. L. Urbanke, “Spatially coupled en- sembles universally achieve capacity under belief propagation,”IEEE Trans. Inf. Theory, vol. 59, no. 12, pp. 7761–7813, Dec. 2013

    work page 2013

  8. [8]

    Windowed decoding of protograph-based LDPC convolutional codes over erasure channels,

    A. R. Iyengar, M. Papaleo, P. H. Siegel, J. K. Wolf, A. Vanelli-Coralli, and G. E. Corazza, “Windowed decoding of protograph-based LDPC convolutional codes over erasure channels,”IEEE Trans. Inf. Theory, vol. 58, no. 4, pp. 2303–2320, 2012

    work page 2012

  9. [9]

    Spatially coupled LDPC codes constructed from protographs,

    D. G. M. Mitchell, M. Lentmaier, and D. J. Costello, “Spatially coupled LDPC codes constructed from protographs,”IEEE Trans. Inf. Theory, vol. 61, no. 9, pp. 4866–4889, Sep. 2015

    work page 2015

  10. [10]

    Spatially coupled generalized LDPC codes: Asymptotic analysis and finite length scaling,

    D. G. M. Mitchell, P. M. Olmos, M. Lentmaier, and D. J. Costello, “Spatially coupled generalized LDPC codes: Asymptotic analysis and finite length scaling,”IEEE Trans. Inf. Theory, vol. 67, no. 6, pp. 3708– 3723, 2021

    work page 2021

  11. [11]

    Spatially coupled turbo-like codes,

    S. Moloudi, M. Lentmaier, and A. Graell i Amat, “Spatially coupled turbo-like codes,”IEEE Trans. Inf. Theory, vol. 63, no. 10, pp. 6199– 6215, Oct 2017

    work page 2017

  12. [12]

    Optimal decoding of lin- ear codes for minimizing symbol error rate,

    L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of lin- ear codes for minimizing symbol error rate,”IEEE Trans. Inf. Theory, vol. 20, no. 2, pp. 284–287, Mar. 1974

    work page 1974

  13. [13]

    Generalized spatially- coupled parallel concatenated codes with partial repetition,

    M. Qiu, X. Wu, J. Yuan, and A. Graell i Amat, “Generalized spatially- coupled parallel concatenated codes with partial repetition,”IEEE Trans. Commun., vol. 70, no. 9, pp. 5771–5787, 2022

    work page 2022

  14. [14]

    Coding theorems for “turbo- like

    D. Divsalar, H. Jin, and R. J. McEliece, “Coding theorems for “turbo- like” codes,” inAllerton Conf. Commun., Control, Comp.,, vol. 36, 1998, pp. 201–210

    work page 1998

  15. [15]

    Braided convolutional codes: A new class of turbo-like codes,

    W. Zhang, M. Lentmaier, K. S. Zigangirov, and D. J. Costello, “Braided convolutional codes: A new class of turbo-like codes,”IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 316–331, Jan. 2010

    work page 2010

  16. [16]

    Braided block codes,

    A. J. Feltstrom, D. Truhachev, M. Lentmaier, and K. S. Zigangirov, “Braided block codes,”IEEE Trans. Inf. Theory, vol. 55, no. 6, pp. 2640–2658, 2009

    work page 2009

  17. [17]

    Half spatially coupled turbo-like codes,

    X. Wu, L. Yang, M. Qiu, C. Han, and J. Yuan, “Half spatially coupled turbo-like codes,” inIEEE Inf. Theory Workshop (ITW), 2025, pp. 1–7

    work page 2025

  18. [18]

    Iterative hard-decision decoding of braided BCH codes for high-speed optical communication,

    Y .-Y . Jian, H. D. Pfister, K. R. Narayanan, R. Rao, and R. Mazahreh, “Iterative hard-decision decoding of braided BCH codes for high-speed optical communication,” inProc. IEEE Globecom, 2013, pp. 2376–2381

    work page 2013

  19. [19]

    International Telecommunication Union - Telecommunication Standard- ization Sector (ITU-T),OTU4 long-reach interface, G.709.2 / Y .1331.2, Jul. 2018

    work page 2018

  20. [20]

    Institute of Electrical and Electronics Engineers (IEEE),Physical Lay- ers and Management Parameters for 100 Gb/s Operation over DWDM Systems, IEEE Std 802.3ct, Jun. 2021

    work page 2021

  21. [21]

    Zipper codes: High-rate spatially-coupled codes with algebraic component codes,

    A. Y . Sukmadji, “Zipper codes: High-rate spatially-coupled codes with algebraic component codes,” Master’s thesis, Univ. Toronto, Dept. Elect. and Comput. Eng., Univ. Toronto, Toronto, ON, Canada,, 2020

    work page 2020

  22. [22]

    Zipper codes,

    A. Y . Sukmadji, U. Mart ´ınez-Pe˜nas, and F. R. Kschischang, “Zipper codes,”J. Lightw. Technol., vol. 40, no. 19, pp. 6397–6407, 2022

    work page 2022

  23. [23]

    Higher-order staircase codes,

    M. Shehadeh, F. R. Kschischang, A. Y . Sukmadji, and W. Kingsford, “Higher-order staircase codes,”IEEE Trans. Inf. Theory, vol. 71, no. 4, pp. 2517–2538, 2025

    work page 2025

  24. [24]

    Least squares superposition codes of moderate dictionary size are reliable at rates up to capacity,

    A. Joseph and A. R. Barron, “Least squares superposition codes of moderate dictionary size are reliable at rates up to capacity,”IEEE Trans. Inf. Theory, vol. 58, no. 5, pp. 2541–2557, 2012

    work page 2012

  25. [25]

    Universal sparse superposition codes with spatial coupling and GAMP decoding,

    J. Barbier, M. Dia, and N. Macris, “Universal sparse superposition codes with spatial coupling and GAMP decoding,”IEEE Trans. Inf. Theory, vol. 65, no. 9, pp. 5618–5642, 2019

    work page 2019

  26. [26]

    Sparse regression codes,

    R. Venkataramanan, S. Tatikonda, and A. Barron, “Sparse regression codes,”Foundations and Trends in Communications and Information Theory, vol. 15, no. 1-2, pp. 1–195, 2019. [Online]. Available: http://dx.doi.org/10.1561/0100000092

    work page doi:10.1561/0100000092 2019

  27. [27]

    Harnessing degrees of freedom of spatially coupled graph codes for agile data storage,

    H. Esfahanizadeh, L. Tauz, and L. Dolecek, “Harnessing degrees of freedom of spatially coupled graph codes for agile data storage,”IEEE BITS the Information Theory Magazine, vol. 3, no. 3, pp. 50–63, 2023

    work page 2023

  28. [28]

    Code design based on connecting spatially coupled graph chains,

    D. Truhachev, D. G. M. Mitchell, M. Lentmaier, D. J. Costello, and A. Karami, “Code design based on connecting spatially coupled graph chains,”IEEE Trans. Inf. Theory, vol. 65, no. 9, pp. 5604–5617, 2019

    work page 2019

  29. [29]

    Self-connected spatially coupled LDPC codes with improved termination,

    Y . Liao, M. Qiu, and J. Yuan, “Self-connected spatially coupled LDPC codes with improved termination,”IEEE Commun. Lett., vol. 27, no. 8, pp. 1959–1963, 2023

    work page 1959

  30. [30]

    Spatially coupled LDPC codes with sub-block locality,

    E. Ram and Y . Cassuto, “Spatially coupled LDPC codes with sub-block locality,”IEEE Trans. Inf. Theory, vol. 67, no. 5, pp. 2739–2757, 2021

    work page 2021

  31. [31]

    On the decoding performance of spatially coupled LDPC codes with sub-block access,

    ——, “On the decoding performance of spatially coupled LDPC codes with sub-block access,”IEEE Trans. Inf. Theory, vol. 68, no. 6, pp. 3700–3718, 2022

    work page 2022

  32. [32]

    A simple proof of threshold saturation for coupled scalar recursions,

    A. Yedla, Y . Jian, P. S. Nguyen, and H. D. Pfister, “A simple proof of threshold saturation for coupled scalar recursions,” inProc. Int. Symp. Turbo Codes Iterative Inf. Process (ISTC), 2012, pp. 51–55

    work page 2012

  33. [33]

    A simple proof of maxwell saturation for coupled scalar recursions,

    A. Yedla, Y .-Y . Jian, P. S. Nguyen, and H. D. Pfister, “A simple proof of maxwell saturation for coupled scalar recursions,”IEEE Trans. Inf. Theory, vol. 60, no. 11, pp. 6943–6965, 2014

    work page 2014

  34. [34]

    Spatial coupling as a proof technique and three applications,

    A. Giurgiu, N. Macris, and R. Urbanke, “Spatial coupling as a proof technique and three applications,”IEEE Trans. Inf. Theory, vol. 62, no. 10, pp. 5281–5295, 2016

    work page 2016

  35. [35]

    Spatially coupled turbo-like codes,

    S. Moloudi, M. Lentmaier, and A. Graell i Amat, “Spatially coupled turbo-like codes,”IEEE Trans. Inf. Theory, vol. 63, no. 10, pp. 6199– 6215, Oct. 2017

    work page 2017

  36. [36]

    Approaching capacity at high rates with iterative hard-decision decoding,

    Y . Y . Jian, H. D. Pfister, and K. R. Narayanan, “Approaching capacity at high rates with iterative hard-decision decoding,”IEEE Trans. Inf. Theory, vol. 63, no. 9, pp. 5752–5773, Sep. 2017

    work page 2017

  37. [37]

    Threshold saturation for nonbi- nary SC-LDPC codes on the binary erasure channel,

    I. Andriyanova and A. Graell i Amat, “Threshold saturation for nonbi- nary SC-LDPC codes on the binary erasure channel,”IEEE Trans. Inf. Theory, vol. 62, no. 5, pp. 2622–2638, 2016

    work page 2016

  38. [38]

    Spatially coupled sparse regression codes for single- and multi-user communications,

    K. Hsieh, “Spatially coupled sparse regression codes for single- and multi-user communications,” Ph.D. dissertation, Cambridge University, Cambridge, UK, 2021. [Online]. Available: https://www.repository.cam. ac.uk/handle/1810/323267

    work page 2021

  39. [39]

    Deter- ministic and ensemble-based spatially-coupled product codes,

    C. H ¨ager, H. D. Pfister, A. Graell i Amat, and F. Br ¨annstr¨om, “Deter- ministic and ensemble-based spatially-coupled product codes,” inProc. IEEE Int. Symp. Inf. Theory (ISIT), 2016, pp. 2114–2118

    work page 2016

  40. [40]

    Universal codes for the Gaussian MAC via spatial coupling,

    A. Yedla, P. S. Nguyen, H. D. Pfister, and K. R. Narayanan, “Universal codes for the Gaussian MAC via spatial coupling,” inProc. Allerton Conf., 2011, pp. 1801–1808

    work page 2011

  41. [41]

    On the univer- sality of spatially coupled LDPC codes over intersymbol interference channels,

    M. M. Mashauri, A. Graell i Amat, and M. Lentmaier, “On the univer- sality of spatially coupled LDPC codes over intersymbol interference channels,” inIEEE Inf. Theory Workshop (ITW), 2021, pp. 1–6

    work page 2021

  42. [42]

    Spatially coupled turbo-like codes: A new trade-off between waterfall and error floor,

    S. Moloudi, M. Lentmaier, and A. Graell i Amat, “Spatially coupled turbo-like codes: A new trade-off between waterfall and error floor,” IEEE Trans. Commun., vol. 67, no. 5, pp. 3114–3123, 2019

    work page 2019

  43. [43]

    Minimum distance and trapping set analysis of protograph-based LDPC convolutional codes,

    D. G. Mitchell, A. E. Pusane, and D. J. Costello, “Minimum distance and trapping set analysis of protograph-based LDPC convolutional codes,” IEEE Trans. Inf. Theory, vol. 59, no. 1, pp. 254–281, 2013

    work page 2013

  44. [44]

    Bounds on the free dis- tance of periodically time-varying SC-LDPC codes,

    M. Battaglioni, M. Baldi, and F. Chiaraluce, “Bounds on the free dis- tance of periodically time-varying SC-LDPC codes,”IEEE Trans. Inf. Theory, vol. 70, no. 4, pp. 2419–2429, 2024

    work page 2024

  45. [45]

    A scaling law to predict the finite- length performance of spatially-coupled LDPC codes,

    P. M. Olmos and R. L. Urbanke, “A scaling law to predict the finite- length performance of spatially-coupled LDPC codes,”IEEE Trans. Inf. Theory, vol. 61, no. 6, pp. 3164–3184, 2015

    work page 2015

  46. [46]

    Finite-length scal- ing of SC-LDPC codes with a limited number of decoding iterations,

    R. Sokolovskii, A. Graell i Amat, and F. Br ¨annstr¨om, “Finite-length scal- ing of SC-LDPC codes with a limited number of decoding iterations,” IEEE Trans. Inf. Theory, vol. 69, no. 8, pp. 4869–4888, 2023

    work page 2023

  47. [47]

    Error propagation mitigation in sliding window decoding of braided convolutional codes,

    M. Zhu, D. G. M. Mitchell, M. Lentmaier, D. J. Costello, and B. Bai, “Error propagation mitigation in sliding window decoding of braided convolutional codes,”IEEE Transactions on Communications, vol. 68, no. 11, pp. 6683–6698, 2020

    work page 2020

  48. [48]

    Error propagation mitigation in sliding window decoding of spatially coupled LDPC codes,

    M. Zhu, D. G. M. Mitchell, M. Lentmaier, and D. J. Costello, “Error propagation mitigation in sliding window decoding of spatially coupled LDPC codes,”IEEE Journal on Selected Areas in Information Theory, vol. 4, pp. 470–486, 2023

    work page 2023

  49. [49]

    Designing protograph-based quasi-cyclic spatially coupled LDPC codes with large girth,

    S. Mo, L. Chen, D. J. Costello, D. G. M. Mitchell, R. Smarandache, and J. Qiu, “Designing protograph-based quasi-cyclic spatially coupled LDPC codes with large girth,”IEEE Trans. Commun., vol. 68, no. 9, pp. 5326–5337, Sept. 2020

    work page 2020

  50. [50]

    Girth anal- ysis and design of periodically time-varying SC-LDPC codes,

    M. Battaglioni, F. Chiaraluce, M. Baldi, and M. Lentmaier, “Girth anal- ysis and design of periodically time-varying SC-LDPC codes,”IEEE Trans. Inf. Theory, vol. 67, no. 4, pp. 2217–2235, Apr. 2021

    work page 2021

  51. [51]

    A class of binary recurrent codes with limited error propagation,

    J. Robinson and A. Bernstein, “A class of binary recurrent codes with limited error propagation,”IEEE Trans. Inf. Theory, vol. 13, no. 1, pp. 106–113, Jan. 1967. IEEE BITS THE INFORMATION THEORY MAGAZINE 16

    work page 1967

  52. [52]

    Construction of LDPC convolutional codes via difference triangle sets,

    G. N. Alfarano, J. Lieb, and J. Rosenthal, “Construction of LDPC convolutional codes via difference triangle sets,”Designs, Codes, and Cryptogr., vol. 89, pp. 2235–2254, Oct. 2020

    work page 2020

  53. [53]

    Low-density parity-check codes from transversal designs with improved stopping set distributions,

    A. Gruner and M. Huber, “Low-density parity-check codes from transversal designs with improved stopping set distributions,”IEEE Trans. Commun., vol. 61, no. 6, pp. 2190–2200, Jun. 2013

    work page 2013

  54. [54]

    A genie-aided approach to error floor estimation for spatially coupled serially concatenated codes,

    F. Wang, S. Zhao, J. Wen, S. Wang, and Z. Li, “A genie-aided approach to error floor estimation for spatially coupled serially concatenated codes,”IEEE Trans. Commun., vol. 71, no. 10, pp. 5713–5725, 2023

    work page 2023

  55. [55]

    Spatially-coupled serially concatenated codes with periodic convolutional permutors,

    M. U. Farooq, A. Graell i Amat, and M. Lentmaier, “Spatially-coupled serially concatenated codes with periodic convolutional permutors,” in International Symposium on Topics in Coding (ISTC), 2021, pp. 1–5

    work page 2021

  56. [56]

    Optimization of SC- LDPC codes for window decoding with target window sizes,

    H.-Y . Kwak, J.-W. Kim, H. Park, and J.-S. No, “Optimization of SC- LDPC codes for window decoding with target window sizes,”IEEE Trans. Commun., vol. 70, no. 5, pp. 2924–2938, 2022

    work page 2022

  57. [57]

    Adaptive sliding window decoding of spatially coupled low-density parity-check codes: Algo- rithms and energy efficient implementations,

    O. Griebel, B. Hammoud, and N. Wehn, “Adaptive sliding window decoding of spatially coupled low-density parity-check codes: Algo- rithms and energy efficient implementations,”IEEE Access, vol. 12, pp. 191 140–191 161, 2024

    work page 2024

  58. [58]

    Rate-loss mitigation of SC-LDPC codes without performance degradation,

    H.-Y . Kwak, D.-Y . Yun, and J.-S. No, “Rate-loss mitigation of SC-LDPC codes without performance degradation,”IEEE Trans. Commun., vol. 68, no. 1, pp. 55–65, 2020

    work page 2020

  59. [59]

    The velocity of the propagating wave for spatially coupled systems with applications to LDPC codes,

    R. El-Khatib and N. Macris, “The velocity of the propagating wave for spatially coupled systems with applications to LDPC codes,”IEEE Trans. Inf. Theory, vol. 64, no. 11, pp. 7113–7131, 2018

    work page 2018

  60. [60]

    Spatially-Coupled QLDPC Codes,

    S. Yang and R. Calderbank, “Spatially-Coupled QLDPC Codes,” Quantum, vol. 9, p. 1693, Apr. 2025. [Online]. Available: https: //doi.org/10.22331/q-2025-04-07-1693

    work page doi:10.22331/q-2025-04-07-1693 2025

  61. [61]

    Achieving AWGN multiple access channel capacity with spatial graph coupling,

    D. Truhachev, “Achieving AWGN multiple access channel capacity with spatial graph coupling,”IEEE Commun. Lett., vol. 16, no. 5, pp. 585– 588, 2012

    work page 2012

  62. [62]

    Coupling data transmission for multiple- access communications,

    D. Truhachev and C. Schlegel, “Coupling data transmission for multiple- access communications,”IEEE Trans. Inf. Theory, vol. 65, no. 7, pp. 4550–4574, 2019. VII. BIOGRAPHY Min Qiu(Senior Member, IEEE) received his Ph.D. degree in Electrical Engi- neering from the University of New South Wales (UNSW), Sydney, Australia, in 2019. From 2019 to 2025, he was a...

    work page 2019