On the minimum distance of array codes as LDPC codes

被引：67
|
作者：
Yang, KC [1 ]
Helleseth, T
机构：
[1] Pohang Univ Sci & Technol, Dept Elect & Elect Engn, Pohang 790784, Kyungbuk, South Korea
[2] Univ Bergen, Dept Informat, N-5008 Bergen, Norway
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2003年 / 49卷 / 12期
关键词：
array codes; low-density parity-check (LDPC) codes; minimum distance;
D O I：
10.1109/TIT.2003.820053
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
For a prime q and an integer j less than or equal to q, the code C(q, j) is a class of low-density parity-check (LDPC) codes from array codes which has a nice algebraic structure. In this correspondence, we investigate the minimum distance d(q, j) of the code in an algebraic way. We first prove that the code is invariant under a doubly transitive group of "affine" permutations. Then, we show that d(5, 4) = 8, d(7, 4) = 8, and d(q, 4) greater than or equal to 10 for any prime q > 7. In addition, we also analyze the codewords of weight 6 in the case of j 3 and the codewords of weight 8 in C(5, 4) and C(7, 4).
引用
收藏
页码：3268 / 3271
页数：4
相关论文
共 50 条
  • [1] More on the Minimum Distance of Array LDPC Codes
    Liu, Haiyang
    Yang, Shipei
    Deng, Gang
    Chen, Jie
    [J]. IEEE COMMUNICATIONS LETTERS, 2014, 18 (09) : 1479 - 1482
  • [2] On the minimum distance of generalized LDPC codes
    Otmani, Ayoub
    Tillich, Jean-Pierre
    Andriyanova, Iryna
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 751 - +
  • [3] An algorithm for the computation of the minimum distance of LDPC codes
    Daneshgaran, F
    Laddomada, M
    Mondin, M
    [J]. EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 2006, 17 (01): : 57 - 62
  • [4] Computing the Minimum Distance of Nonbinary LDPC Codes
    Liu, Lei
    Huang, Jie
    Zhou, Wuyang
    Zhou, Shengli
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2012, 60 (07) : 1753 - 1758
  • [5] A Note on the Minimum Distance of Quantum LDPC Codes
    Delfosse, Nicolas
    Li, Zhentao
    Thomasse, Stephan
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, PT II, 2014, 8635 : 239 - 250
  • [6] An algorithm for the estimation of the minimum distance of LDPC codes
    Daneshgaran, F
    Laddomada, M
    Mondin, M
    [J]. 2005 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4: WCNC 2005: BROADBAND WIRELESS FOR THE MASSES READY FOR TAKE-OFF., 2005, : 1046 - 1049
  • [7] Quantum LDPC Codes With Almost Linear Minimum Distance
    Panteleev, Pavel
    Kalachev, Gleb
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (01) : 213 - 229
  • [8] On the Minimum Distance of Generalized Spatially Coupled LDPC Codes
    Mitchell, David G. M.
    Lentmaier, Michael
    Costello, Daniel J., Jr.
    [J]. 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1874 - +
  • [9] Construction of protograph LDPC codes with linear minimum distance
    Divsalar, Dariush
    Dolinar, Sam
    Jones, Christopher
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 664 - +
  • [10] On the Minimum Distance of Some Improper Array Codes
    Liu, Haiyang
    Ma, Lianrong
    Zhang, Hao
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2019, E102A (12) : 2021 - 2026
12345