dc.citation.conferencePlace |
TU |
- |
dc.citation.conferencePlace |
Istanbul; Turkey |
- |
dc.citation.endPage |
2665 |
- |
dc.citation.startPage |
2661 |
- |
dc.citation.title |
2013 IEEE International Symposium on Information Theory, ISIT 2013 |
- |
dc.contributor.author |
Kim, Kyung-Joong |
- |
dc.contributor.author |
Chung, Jin-Ho |
- |
dc.contributor.author |
Yang, Kyeongcheol |
- |
dc.date.accessioned |
2023-12-20T00:41:21Z |
- |
dc.date.available |
2023-12-20T00:41:21Z |
- |
dc.date.created |
2014-01-02 |
- |
dc.date.issued |
2013-07-07 |
- |
dc.description.abstract |
Short cycles in the Tanner graph of a low-density parity-check (LDPC) code may cause a severe performance degradation. In this paper, we investigate the cycle properties of quasi-cyclic LDPC (QC-LDPC) codes. We first analyze a necessary and sufficient condition for a cycle of a given length to exist, by using the sequence representation of a parity-check matrix for a QC-LDPC code. We then derive bounds which are necessary conditions for a QC-LDPC code to have a given girth in terms of its parameters. Our necessary conditions are applicable to any regular or irregular QC-LDPC codes as well as they improve the existing bounds for many classes of regular QC-LDPC codes. |
- |
dc.identifier.bibliographicCitation |
2013 IEEE International Symposium on Information Theory, ISIT 2013, pp.2661 - 2665 |
- |
dc.identifier.doi |
10.1109/ISIT.2013.6620709 |
- |
dc.identifier.isbn |
978-147990446-4 |
- |
dc.identifier.issn |
2157-8095 |
- |
dc.identifier.scopusid |
2-s2.0-84890419059 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/37396 |
- |
dc.identifier.url |
https://ieeexplore.ieee.org/document/6620709 |
- |
dc.language |
영어 |
- |
dc.publisher |
2013 IEEE International Symposium on Information Theory, ISIT 2013 |
- |
dc.title |
Necessary conditions for quasi-cyclic LDPC codes to have a given girth |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2013-07-07 |
- |