Please use this identifier to cite or link to this item: https://doi.org/10.1109/LCOMM.2006.1633330
Title: On the stopping distance of finite geometry LDPC codes
Authors: Xia, S.-T.
Fu, F.-W. 
Keywords: Finite-geometry LDPC codes
Iterative decoding
LDPC codes
Stopping distance
Stopping set
Issue Date: May-2006
Citation: Xia, S.-T., Fu, F.-W. (2006-05). On the stopping distance of finite geometry LDPC codes. IEEE Communications Letters 10 (5) : 381-383. ScholarBank@NUS Repository. https://doi.org/10.1109/LCOMM.2006.1633330
Abstract: In this letter, the stopping sets and stopping distance of finite geometry LDPC (FG-LDPC) codes are studied. It is known that FG-LDPC codes are majority-logic decodable and a lower bound on the minimum distance can be thus obtained. It is shown in this letter that this lower bound on the minimum distance of FG-LDPC codes is also a lower bound on the stopping distance of FG-LDPC codes, which implies that FG-LDPC codes have considerably large stopping distance. This may explain in one respect why some FG-LDPC codes perform well with iterative decoding in spite of having many cycles of length 4 in their Tanner graphs. © 2006 IEEE.
Source Title: IEEE Communications Letters
URI: http://scholarbank.nus.edu.sg/handle/10635/111454
ISSN: 10897798
DOI: 10.1109/LCOMM.2006.1633330
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

22
checked on Dec 12, 2018

WEB OF SCIENCETM
Citations

21
checked on Dec 12, 2018

Page view(s)

36
checked on Oct 26, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.