Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels
Information Theory
2016-11-17 v2 Discrete Mathematics
Combinatorics
math.IT
Abstract
We present Kovalenko's full-rank limit as a tight lower bound for decoding error probability of LDPC codes and LT codes over BEC. From the limit, we derive a full-rank overhead as a lower bound for stable overheads for successful maximum-likelihood decoding of the codes.
Keywords
Cite
@article{arxiv.0808.0272,
title = {Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels},
author = {Ki-Moon Lee and Hayder Radha and Beom-Jin Kim},
journal= {arXiv preprint arXiv:0808.0272},
year = {2016}
}
Comments
A short version of this paper was presented at ISITA 2008, Auckland NZ. The first draft was submitted to IEEE Transactions on Information Theory, 2008/06