Title
Girth-Eight Reed-Solomon Based QC-LDPC Codes
Abstract
This paper presents a class of regular quasi-cyclic (QC) LDPC codes whose Tanner graphs have girth at least eight. These codes are constructed based on the conventional parity-check matrices of Reed-Solomon (RS) codes with minimum distance 5. Masking their parity-check matrices significantly reduces the numbers of short cycles in their Tanner graphs and results in codes which perform well over the AWGN channel in both waterfall and low error-rate regions.
Year
DOI
Venue
2018
10.1109/ISTC.2018.8625328
2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)
Keywords
Field
DocType
AWGN channel,Tanner graphs,error-rate regions,Reed-Solomon codes,conventional parity-check matrices,quasicyclic LDPC codes,girth-eight Reed-Solomon based QC-LDPC codes
Discrete mathematics,Graph,Low-density parity-check code,Matrix (mathematics),Communication channel,Reed–Solomon error correction,Additive white Gaussian noise,Mathematics
Conference
ISSN
ISBN
Citations 
2165-4700
978-1-5386-7049-1
0
PageRank 
References 
Authors
0.34
4
5
Name
Order
Citations
PageRank
Xin Xiao132.41
Bane V. Vasic251560.72
S. Lin31280124.59
Khaled A. S. Abdel-Ghaffar4616122.03
W. E. Ryan514712.18