Protograph design for QC LDPC codes with large girth
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Park, Hosung | - |
dc.contributor.author | Hong, Seokbeom | - |
dc.contributor.author | No, Jong-Seon | - |
dc.contributor.author | Shin, Dong-Joon | - |
dc.date.accessioned | 2022-12-20T10:43:30Z | - |
dc.date.available | 2022-12-20T10:43:30Z | - |
dc.date.created | 2022-09-16 | - |
dc.date.issued | 2010-12 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/173290 | - |
dc.description.abstract | In this paper, all subgraph patterns of protographs which prevent quasi-cyclic (QC) low-density parity-check (LDPC) codes from having large girth are searched in allowance with multiple edges based on graph theoretic approach. A systematic construction of protograph with multiple edges using combinatorial design is proposed for QC LDPC codes with girth larger than or equal to 12. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE | - |
dc.title | Protograph design for QC LDPC codes with large girth | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Shin, Dong-Joon | - |
dc.identifier.doi | 10.1109/ICTC.2010.5674263 | - |
dc.identifier.scopusid | 2-s2.0-78751500491 | - |
dc.identifier.bibliographicCitation | 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010, pp.175 - 176 | - |
dc.relation.isPartOf | 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010 | - |
dc.citation.title | 2010 International Conference on Information and Communication Technology Convergence, ICTC 2010 | - |
dc.citation.startPage | 175 | - |
dc.citation.endPage | 176 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Combinatorial design | - |
dc.subject.keywordPlus | Graph theoretic approach | - |
dc.subject.keywordPlus | Low-density parity-check codes | - |
dc.subject.keywordPlus | Protograph | - |
dc.subject.keywordPlus | QC LDPC codes | - |
dc.subject.keywordPlus | Quasi-cyclic | - |
dc.subject.keywordPlus | Subgraphs | - |
dc.subject.keywordPlus | Codes (symbols) | - |
dc.subject.keywordPlus | Coding errors | - |
dc.subject.keywordPlus | Frequency selective fading | - |
dc.subject.keywordPlus | Graph theory | - |
dc.subject.keywordPlus | Information technology | - |
dc.subject.keywordPlus | Error correction | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/5674263 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.