BROWSE

Related Researcher

Author

Chung, Jin-Ho
Communications and Code Design Lab (CCDL)
Research Interests
  • Sequences, channel coding, quantum information theory

ITEM VIEW & DOWNLOAD

Bounds on the size of parity-check matrices for quasi-cyclic low-density parity-check codes

Cited 1 times inthomson ciCited 1 times inthomson ci
Title
Bounds on the size of parity-check matrices for quasi-cyclic low-density parity-check codes
Author
Kim, Kyung-JoongChung, Jin-HoYang, Kyeongcheol
Keywords
Cycle; Cycle property; girth; Greedy algorithms; Low-density parity-check (LDPC) codes; Quasi cyclic low density parity check codes; Quasicyclic codes; Quasicyclic low-density parity-check (QC-LDPC) code
Issue Date
201311
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Citation
IEEE TRANSACTIONS ON INFORMATION THEORY, v.59, no.11, pp.7288 - 7298
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.
URI
Go to Link
DOI
http://dx.doi.org/10.1109/TIT.2013.2279831
ISSN
0018-9448
Appears in Collections:
ECE_Journal Papers

find_unist can give you direct access to the published full text of this article. (UNISTARs only)

Show full item record

qr_code

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

MENU