IEICE TRANSACTIONS on Communications
Design of Quasi-Cyclic Cycle LDPC Codes over GF(q)
Summary :
Quasi-cyclic (QC) low-density parity-check (LDPC) codes have several appealing properties regarding decoding, storage requirements and encoding aspects. In this paper, we focus on the QC LDPC codes over GF(q) whose parity-check matrices have fixed column weight j = 2. By investigating two subgraphs in the Tanner graphs of the corresponding base matrices, we derive two upper bounds on the minimum Hamming distance for this class of codes. In addition, a method is proposed to construct QC LDPC codes over GF(q), which have good Hamming distance distributions. Simulations show that our designed codes have good performance.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E95-B No.3 pp.983-986
- Publication Date
- 2012/03/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E95.B.983
- Type of Manuscript
- LETTER
- Category
- Fundamental Theories for Communications
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
ShuKai HU, Chao CHEN, Rong SUN, XinMei WANG, "Design of Quasi-Cyclic Cycle LDPC Codes over GF(q)" in IEICE TRANSACTIONS on Communications,
vol. E95-B, no. 3, pp. 983-986, March 2012, doi: 10.1587/transcom.E95.B.983.
Abstract: Quasi-cyclic (QC) low-density parity-check (LDPC) codes have several appealing properties regarding decoding, storage requirements and encoding aspects. In this paper, we focus on the QC LDPC codes over GF(q) whose parity-check matrices have fixed column weight j = 2. By investigating two subgraphs in the Tanner graphs of the corresponding base matrices, we derive two upper bounds on the minimum Hamming distance for this class of codes. In addition, a method is proposed to construct QC LDPC codes over GF(q), which have good Hamming distance distributions. Simulations show that our designed codes have good performance.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.983/_p
Copy
@ARTICLE{e95-b_3_983,
author={ShuKai HU, Chao CHEN, Rong SUN, XinMei WANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Design of Quasi-Cyclic Cycle LDPC Codes over GF(q)},
year={2012},
volume={E95-B},
number={3},
pages={983-986},
abstract={Quasi-cyclic (QC) low-density parity-check (LDPC) codes have several appealing properties regarding decoding, storage requirements and encoding aspects. In this paper, we focus on the QC LDPC codes over GF(q) whose parity-check matrices have fixed column weight j = 2. By investigating two subgraphs in the Tanner graphs of the corresponding base matrices, we derive two upper bounds on the minimum Hamming distance for this class of codes. In addition, a method is proposed to construct QC LDPC codes over GF(q), which have good Hamming distance distributions. Simulations show that our designed codes have good performance.},
keywords={},
doi={10.1587/transcom.E95.B.983},
ISSN={1745-1345},
month={March},}
Copy
TY - JOUR
TI - Design of Quasi-Cyclic Cycle LDPC Codes over GF(q)
T2 - IEICE TRANSACTIONS on Communications
SP - 983
EP - 986
AU - ShuKai HU
AU - Chao CHEN
AU - Rong SUN
AU - XinMei WANG
PY - 2012
DO - 10.1587/transcom.E95.B.983
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2012
AB - Quasi-cyclic (QC) low-density parity-check (LDPC) codes have several appealing properties regarding decoding, storage requirements and encoding aspects. In this paper, we focus on the QC LDPC codes over GF(q) whose parity-check matrices have fixed column weight j = 2. By investigating two subgraphs in the Tanner graphs of the corresponding base matrices, we derive two upper bounds on the minimum Hamming distance for this class of codes. In addition, a method is proposed to construct QC LDPC codes over GF(q), which have good Hamming distance distributions. Simulations show that our designed codes have good performance.
ER -
English
