2000 character limit reached
A Refined Scaling Law for Spatially Coupled LDPC Codes Over the Binary Erasure Channel
Published 23 Apr 2019 in cs.IT and math.IT | (1904.10410v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.