Girth-Eight Reed-Solomon Based QC-LDPC Codes

Xin Xiao, Bane Vasić, Shu Lin, Khaled Abdel-Ghaffar, William E. Ryan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018
PublisherIEEE Computer Society
ISBN (Electronic)9781538670484
DOIs
StatePublished - Jan 23 2019
Event10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018 - Hong Kong, China
Duration: Dec 3 2018Dec 7 2018

Publication series

NameInternational Symposium on Turbo Codes and Iterative Information Processing, ISTC
Volume2018-December
ISSN (Print)2165-4700
ISSN (Electronic)2165-4719

Conference

Conference10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018
CountryChina
CityHong Kong
Period12/3/1812/7/18

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Girth-Eight Reed-Solomon Based QC-LDPC Codes'. Together they form a unique fingerprint.

  • Cite this

    Xiao, X., Vasić, B., Lin, S., Abdel-Ghaffar, K., & Ryan, W. E. (2019). Girth-Eight Reed-Solomon Based QC-LDPC Codes. In 2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018 [8625328] (International Symposium on Turbo Codes and Iterative Information Processing, ISTC; Vol. 2018-December). IEEE Computer Society. https://doi.org/10.1109/ISTC.2018.8625328