# A Refined Scaling Law for Spatially Coupled LDPC Codes Over the Binary Erasure Channel

## TL;DR

This paper introduces an improved scaling law for spatially coupled LDPC codes over the binary erasure channel, enhancing prediction accuracy of finite-length performance and extending to bit error rate estimation.

## Contribution

It refines the existing scaling law by Olmos and Urbanke, providing more accurate predictions of code performance in the waterfall region and extending applicability to bit error rates.

## Key findings

- Enhanced scaling law aligns better with simulations.
- Improved prediction of frame error rate.
- Extended model to predict bit error rate.

## Abstract

We propose a refined scaling law to predict the finite-length performance in the waterfall region of spatially coupled low-density parity-check codes over the binary erasure channel. In particular, we introduce some improvements to the scaling law proposed by Olmos and Urbanke that result in a better agreement between the predicted and simulated frame error rate. We also show how the scaling law can be extended to predict the bit error rate performance.