New LDPC Codes Using Permutation Matrices with Higher Girth than QC-LDPC Codes Constructed by Fossorier
Information Theory
2016-11-25 v3 Discrete Mathematics
Combinatorics
math.IT
Abstract
In the literatures, it is well-known that Fossorier code has the girth among LDPC codes. In this paper, we introduce a new class of low-density parity-check (LDPC) codes, with higher girth than other previous constructed codes. Especially we proposed a new method to construct LDPC codes using non fixed shift permutation matrices and full based matrices with higher girth than codes constructed by Fossorier.
Cite
@article{arxiv.1402.1614,
title = {New LDPC Codes Using Permutation Matrices with Higher Girth than QC-LDPC Codes Constructed by Fossorier},
author = {Mehdi samadieh and Mohammad Gholami},
journal= {arXiv preprint arXiv:1402.1614},
year = {2016}
}
Comments
This paper has been withdrawn by the authors. Some conclusions in the submitted paper are wrong and the authors decided to withdraw the paper