The search functionality is under construction.
The search functionality is under construction.

On the Stopping Distance and Stopping Redundancy of Finite Geometry LDPC Codes

Hai-yang LIU, Xiao-yan LIN, Lian-rong MA, Jie CHEN

  • Full Text Views

    0

  • Cite this

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