Quasi-Cyclic LDPC Codes with Parity-Check Matrices of Column Weight Two or More for Correcting Phased Bursts of Erasures
Final Accepted Manuscript
AffiliationDepartment of Electrical and Computer Engineering, University of Arizona
Maximum likelihood decoding
Parity check codes
MetadataShow full item record
CitationXiao, X., Vasić, B., Lin, S., Li, J., & Abdel-Ghaffar, K. (2021). Quasi-Cyclic LDPC Codes with Parity-Check Matrices of Column Weight Two or More for Correcting Phased Bursts of Erasures. IEEE Transactions on Communications.
Rights© 2021 IEEE.
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at firstname.lastname@example.org.
AbstractIn his pioneering work on LDPC codes, Gallager dismissed codes with parity-check matrices of weight two after proving that their minimum Hamming distances grow at most logarithmically with their code lengths. In spite of their poor minimum Hamming distances, it is shown that quasi-cyclic LDPC codes with parity-check matrices of column weight two have good capability to correct phased bursts of erasures which may not be surpassed by using quasi-cyclic LDPC codes with parity-check matrices of column weight three or more. By modifying the parity-check matrices of column weight two and globally coupling them, the erasure correcting capability can be further enhanced. Quasi-cyclic LDPC codes with parity-check matrices of column weight three or more that can correct phased bursts of erasures and perform well over the AWGN channel are also considered. Examples of such codes based on Reed-Solomon and Gabidulin codes are presented.
VersionFinal accepted manuscript
SponsorsDivision of Electrical, Communications and Cyber Systems