Optimal Rate Irregular LDPC Codes in Binary Erasure Channel
Information Theory
2012-11-28 v1 math.IT
Abstract
In this paper, we design the optimal rate capacity approaching irregular Low-Density Parity-Check code ensemble over Binary Erasure Channel, by using practical Semi-Definite Programming approach. Our method does not use any relaxation or any approximate solution unlike previous works. Our simulation results include two parts; first, we present some codes and their degree distribution functions that their rates are close to the capacity. Second, the maximum achievable rate behavior of codes in our method is illustrated through some figures.
Cite
@article{arxiv.1211.6279,
title = {Optimal Rate Irregular LDPC Codes in Binary Erasure Channel},
author = {H. Tavakoli and M. Ahmadian and M. Reza Peyghami},
journal= {arXiv preprint arXiv:1211.6279},
year = {2012}
}
Comments
published in IET Communications