Finite Length Analysis of LDPC Codes
classification
💻 cs.IT
math.IT
keywords
codesldpcperformancefinite-lengthalgorithmanalysisbetterbinary
read the original abstract
In this paper, we study the performance of finite-length LDPC codes in the waterfall region. We propose an algorithm to predict the error performance of finite-length LDPC codes over various binary memoryless channels. Through numerical results, we find that our technique gives better performance prediction compared to existing techniques.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.