A cyclic‐shift based method for counting cycles of quasi‐cyclic LDPC codes
A cyclic‐shift based method for counting cycles of quasi‐cyclic LDPC codes
About this item
Full title
Author / Creator
Xu, Hengzhou , Zhang, Xiao‐Dong , Li, Huaan , Zhu, Hai , Zhang, Bo and Liu, Hui
Journal title
Language
English
Formats
Subjects
More information
Scope and Contents
Contents
M. Fossorier proposed how to determine the necessary and sufficient conditions for the existence of cycles in the Tanner graph of quasi‐cyclic LDPC (QC‐LDPC) codes, which has been widely investigated in the study of LDPC codes. This paper presents some new necessary and sufficient conditions for the existence of cycles with arbitrary lengths and pr...
Alternative Titles
Full title
A cyclic‐shift based method for counting cycles of quasi‐cyclic LDPC codes
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_crossref_primary_10_1049_ell2_13085
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_crossref_primary_10_1049_ell2_13085
Other Identifiers
ISSN
0013-5194
E-ISSN
1350-911X
DOI
10.1049/ell2.13085
