English

Finite Length Analysis of LDPC Codes

Information Theory 2013-09-30 v1 math.IT

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.

Keywords

Cite

@article{arxiv.1309.7102,
  title  = {Finite Length Analysis of LDPC Codes},
  author = {Md. Noor-A-Rahim and Khoa D. Nguyen and Gottfried Lechner},
  journal= {arXiv preprint arXiv:1309.7102},
  year   = {2013}
}

Comments

Submitted to WCNC 2014

R2 v1 2026-06-22T01:35:12.258Z