IEICE TRANSACTIONS on Fundamentals
Further Results on the Stopping Distance of Array LDPC Matrices
Summary :
Given an odd prime q and an integer m ≤ q, an array-based parity-check matrix H(m,q) can be constructed for a quasi-cyclic low-density parity-check (LDPC) code C(m,q). For m=4 and q ≥ 11, we prove the stopping distance of H(4,q) is 10, which is equal to the minimum Hamming distance of the associated code C(4,q). In addition, a tighter lower bound on the stopping distance of H(m,q) is also given for m > 4 and q ≥ 11.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E95-A No.5 pp.918-926
- Publication Date
- 2012/05/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E95.A.918
- Type of Manuscript
- PAPER
- Category
- Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Haiyang LIU, Lu HE, Jie CHEN, "Further Results on the Stopping Distance of Array LDPC Matrices" in IEICE TRANSACTIONS on Fundamentals,
vol. E95-A, no. 5, pp. 918-926, May 2012, doi: 10.1587/transfun.E95.A.918.
Abstract: Given an odd prime q and an integer m ≤ q, an array-based parity-check matrix H(m,q) can be constructed for a quasi-cyclic low-density parity-check (LDPC) code C(m,q). For m=4 and q ≥ 11, we prove the stopping distance of H(4,q) is 10, which is equal to the minimum Hamming distance of the associated code C(4,q). In addition, a tighter lower bound on the stopping distance of H(m,q) is also given for m > 4 and q ≥ 11.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.918/_p
Copy
@ARTICLE{e95-a_5_918,
author={Haiyang LIU, Lu HE, Jie CHEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Further Results on the Stopping Distance of Array LDPC Matrices},
year={2012},
volume={E95-A},
number={5},
pages={918-926},
abstract={Given an odd prime q and an integer m ≤ q, an array-based parity-check matrix H(m,q) can be constructed for a quasi-cyclic low-density parity-check (LDPC) code C(m,q). For m=4 and q ≥ 11, we prove the stopping distance of H(4,q) is 10, which is equal to the minimum Hamming distance of the associated code C(4,q). In addition, a tighter lower bound on the stopping distance of H(m,q) is also given for m > 4 and q ≥ 11.},
keywords={},
doi={10.1587/transfun.E95.A.918},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - Further Results on the Stopping Distance of Array LDPC Matrices
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 918
EP - 926
AU - Haiyang LIU
AU - Lu HE
AU - Jie CHEN
PY - 2012
DO - 10.1587/transfun.E95.A.918
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2012
AB - Given an odd prime q and an integer m ≤ q, an array-based parity-check matrix H(m,q) can be constructed for a quasi-cyclic low-density parity-check (LDPC) code C(m,q). For m=4 and q ≥ 11, we prove the stopping distance of H(4,q) is 10, which is equal to the minimum Hamming distance of the associated code C(4,q). In addition, a tighter lower bound on the stopping distance of H(m,q) is also given for m > 4 and q ≥ 11.
ER -
English
