On the minimum distance of array codes as LDPC codes
SCIE
SCOPUS
- Title
- On the minimum distance of array codes as LDPC codes
- Authors
- Yang, KC; Helleseth, T
- Date Issued
- 2003-12
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGI
- Abstract
- 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).
- Keywords
- array codes; low-density parity-check (LDPC) codes; minimum distance; PARITY-CHECK CODES
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/18149
- DOI
- 10.1109/TIT.2003.820053
- ISSN
- 0018-9448
- Article Type
- Article
- Citation
- IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 49, no. 12, page. 3268 - 3271, 2003-12
- 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.