Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check Codes
SCIE
SCOPUS
- Title
- Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check Codes
- Authors
- Kim, KJ; Chung, JH; Yang, K
- Date Issued
- 2013-11
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Abstract
- In this paper, we investigate the cycle properties of quasi-cyclic low-density parity-check (QC-LDPC) codes. Using the sequence representation of a parity-check matrix for a QC-LDPC code, we analyze a necessary and sufficient condition for a cycle of a given length to exist. We then derive bounds which are necessary conditions for a QC-LDPC code to have a given girth in terms of its parameters. We also give a bound which is a sufficient condition for a QC-LDPC code of a given girth to be constructed by a greedy algorithm. The bounds derived here are applicable to any regular or irregular QC-LDPC codes as well as they improve the existing bounds in many classes of regular LDPC codes.
- Keywords
- Cycle; girth; low-density parity-check (LDPC) codes; quasi-cyclic codes; LDPC CODES
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/15095
- DOI
- 10.1109/TIT.2013.2279831
- ISSN
- 0018-9448
- Article Type
- Article
- Citation
- IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 59, no. 11, page. 7288 - 7298, 2013-11
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.