TY - GEN
T1 - Girth-Eight Reed-Solomon Based QC-LDPC Codes
AU - Xiao, Xin
AU - Vasić, Bane
AU - Lin, Shu
AU - Abdel-Ghaffar, Khaled
AU - Ryan, William E.
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/7/2
Y1 - 2018/7/2
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85062393657&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85062393657&partnerID=8YFLogxK
U2 - 10.1109/ISTC.2018.8625328
DO - 10.1109/ISTC.2018.8625328
M3 - Conference contribution
AN - SCOPUS:85062393657
T3 - International Symposium on Turbo Codes and Iterative Information Processing, ISTC
BT - 2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018
PB - IEEE Computer Society
T2 - 10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018
Y2 - 3 December 2018 through 7 December 2018
ER -