IEICE TRANSACTIONS on Fundamentals
On the Stopping Distance and Stopping Redundancy of Finite Geometry LDPC Codes
Summary :
The stopping distance and stopping redundancy of a linear code are important concepts in the analysis of the performance and complexity of the code under iterative decoding on a binary erasure channel. In this paper, we studied the stopping distance and stopping redundancy of Finite Geometry LDPC (FG-LDPC) codes, and derived an upper bound of the stopping redundancy of FG-LDPC codes. It is shown from the bound that the stopping redundancy of the codes is less than the code length. Therefore, FG-LDPC codes give a good trade-off between the performance and complexity and hence are a very good choice for practical applications.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E91-A No.8 pp.2159-2166
- Publication Date
- 2008/08/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e91-a.8.2159
- 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
Hai-yang LIU, Xiao-yan LIN, Lian-rong MA, Jie CHEN, "On the Stopping Distance and Stopping Redundancy of Finite Geometry LDPC Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 8, pp. 2159-2166, August 2008, doi: 10.1093/ietfec/e91-a.8.2159.
Abstract: The stopping distance and stopping redundancy of a linear code are important concepts in the analysis of the performance and complexity of the code under iterative decoding on a binary erasure channel. In this paper, we studied the stopping distance and stopping redundancy of Finite Geometry LDPC (FG-LDPC) codes, and derived an upper bound of the stopping redundancy of FG-LDPC codes. It is shown from the bound that the stopping redundancy of the codes is less than the code length. Therefore, FG-LDPC codes give a good trade-off between the performance and complexity and hence are a very good choice for practical applications.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.8.2159/_p
Copy
@ARTICLE{e91-a_8_2159,
author={Hai-yang LIU, Xiao-yan LIN, Lian-rong MA, Jie CHEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Stopping Distance and Stopping Redundancy of Finite Geometry LDPC Codes},
year={2008},
volume={E91-A},
number={8},
pages={2159-2166},
abstract={The stopping distance and stopping redundancy of a linear code are important concepts in the analysis of the performance and complexity of the code under iterative decoding on a binary erasure channel. In this paper, we studied the stopping distance and stopping redundancy of Finite Geometry LDPC (FG-LDPC) codes, and derived an upper bound of the stopping redundancy of FG-LDPC codes. It is shown from the bound that the stopping redundancy of the codes is less than the code length. Therefore, FG-LDPC codes give a good trade-off between the performance and complexity and hence are a very good choice for practical applications.},
keywords={},
doi={10.1093/ietfec/e91-a.8.2159},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - On the Stopping Distance and Stopping Redundancy of Finite Geometry LDPC Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2159
EP - 2166
AU - Hai-yang LIU
AU - Xiao-yan LIN
AU - Lian-rong MA
AU - Jie CHEN
PY - 2008
DO - 10.1093/ietfec/e91-a.8.2159
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2008
AB - The stopping distance and stopping redundancy of a linear code are important concepts in the analysis of the performance and complexity of the code under iterative decoding on a binary erasure channel. In this paper, we studied the stopping distance and stopping redundancy of Finite Geometry LDPC (FG-LDPC) codes, and derived an upper bound of the stopping redundancy of FG-LDPC codes. It is shown from the bound that the stopping redundancy of the codes is less than the code length. Therefore, FG-LDPC codes give a good trade-off between the performance and complexity and hence are a very good choice for practical applications.
ER -
English
