# A Finite-Length Construction of Irregular Spatially-Coupled Codes

## TL;DR

This paper introduces a new combinatorial framework for designing finite-length irregular spatially-coupled LDPC codes that combine the structural advantages of regular codes with improved performance due to irregularity.

## Contribution

It presents a novel combinatorial design method for finite-length irregular SC LDPC codes, enhancing performance while maintaining desirable structural properties.

## Key findings

- Irregular SC LDPC codes outperform regular ones in finite-length scenarios.
- The proposed construction maintains regular SC code properties with added performance benefits.
- Contributes new finite-length graph code design techniques.

## Abstract

Spatially-coupled (SC) LDPC codes have recently emerged as an excellent choice for error correction in modern data storage and communication systems due to their outstanding performance. It has long been known that irregular graph codes offer performance advantage over their regular counterparts. In this paper, we present a novel combinatorial framework for designing finite-length irregular SC LDPC codes. Our irregular SC codes have the desirable properties of regular SC codes thanks to their structure while offering significant performance benefits that come with the node degree irregularity. Coding constructions proposed in this work contribute to the existing portfolio of finite-length graph code designs.