A class of quasi-cyclic regular LDPC codes from cyclic difference families with girth 8

被引：0
|
作者：
Fujisawa, M [1 ]
Sakata, S [1 ]
机构：
[1] Tokyo Univ Sci, Shinjuku Ku, Tokyo 1628601, Japan
来源：
2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2 | 2005年
关键词：
D O I：
暂无
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
In this paper, we propose a class of regular LDPC codes from a cyclic difference family, which is a kind of combinatorial design. These LDPC codes have no 4-cycles, i.e., cycles of length 4. We clarify the conditions on which these codes with column weight 3 have no 6-cycles and discuss their minimum distance. Finally, we show the performance of the proposed codes with high rates and moderate lengths.
引用
收藏
页码：2290 / 2294
页数：5
相关论文
共 50 条
  • [11] Quasi-Cyclic LDPC Codes With Girth at Least Eight Based on Disjoint Difference Sets
    Zhang, Guohua
    Ni, Mengdi
    Hu, Yulin
    Yang, Yang
    IEEE COMMUNICATIONS LETTERS, 2023, 27 (01) : 55 - 59
  • [12] Quasi-cyclic codes from extended difference families
    Xia, T
    Xia, B
    2005 IEEE Wireless Communications and Networking Conference, Vols 1-4: WCNC 2005: BROADBAND WIRELESS FOR THE MASSES READY FOR TAKE-OFF., 2005, : 1036 - 1040
  • [13] The Necessary and Sufficient Condition of a Class of Quasi-Cyclic LDPC Codes without Girth Four
    Zhao, Ying
    Xiao, Yang
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2009, E92B (01) : 306 - 309
  • [14] A Note on the Girth of (3,19)-Regular Tanner's Quasi-Cyclic LDPC Codes
    Zhou, Manjie
    Zhu, Hai
    Xu, Hengzhou
    Zhang, Bo
    Xie, Kaixuan
    IEEE ACCESS, 2021, 9 : 28582 - 28590
  • [15] Overlapped decoding for a class of quasi-cyclic LDPC codes
    Kim, SM
    Parhi, KK
    2004 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS DESIGN AND IMPLEMENTATION, PROCEEDINGS, 2004, : 113 - 117
  • [16] On the girth of Tanner (3,11) quasi-cyclic LDPC codes
    Xu, Hengzhou
    Bai, Baoming
    Feng, Dan
    Sun, Cheng
    FINITE FIELDS AND THEIR APPLICATIONS, 2017, 46 : 65 - 89
  • [17] On the girth of Tanner (3,5) quasi-cyclic LDPC codes
    Kim, S
    No, JS
    Chung, HB
    Shin, DJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) : 1739 - 1744
  • [18] An efficient girth-locating algorithm for quasi-cyclic LDPC codes
    Wu, Xiaofu
    You, Xiaohu
    Zhao, Chunming
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 817 - +
  • [19] Necessary Conditions for Quasi-Cyclic LDPC Codes to Have a Given Girth
    Kim, Kyung-Joong
    Chung, Jin-Ho
    Yang, Kyeongcheol
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 2661 - +
  • [20] SEARCHING FOR LARGE GIRTH QUASI-CYCLIC SPATIALLY COUPLED LDPC CODES
    Wu, Zhan-Ji
    Wang, Shuo-Shuo
    Zhao, Min
    2019 16TH INTERNATIONAL COMPUTER CONFERENCE ON WAVELET ACTIVE MEDIA TECHNOLOGY AND INFORMATION PROCESSING (ICWAMTIP), 2019, : 361 - 364
12345