Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures
| dc.contributor.author | Xiao, Xin | |
| dc.contributor.author | Vasic, Bane | |
| dc.contributor.author | Lin, Shu | |
| dc.contributor.author | Abdel-Ghaffar, Khaled | |
| dc.contributor.author | Ryan, William E. | |
| dc.date.accessioned | 2019-11-07T01:28:12Z | |
| dc.date.available | 2019-11-07T01:28:12Z | |
| dc.date.issued | 2019-07 | |
| dc.identifier.citation | Xiao, X., Vasić, B., Lin, S., Abdel-Ghaffar, K., & Ryan, W. E. (2019, July). Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures. In 2019 IEEE International Symposium on Information Theory (ISIT) (pp. 71-75). IEEE. | en_US |
| dc.identifier.issn | 2157-8117 | |
| dc.identifier.doi | 10.1109/isit.2019.8849853 | |
| dc.identifier.uri | http://hdl.handle.net/10150/634971 | |
| dc.description.abstract | This paper presents designs and constructions of two classes of binary quasi-cyclic LDPC codes for correcting multiple random phased-bursts of erasures over the binary erasure channel. The erasure correction of codes in both classes is characterized by the cycle and adjacency structure of their Tanner graphs. Erasure correction of these codes is a very simple process which requires only modulo-2 additions. The codes in the second class are capable of correcting locally and globally distributed phased-bursts of erasures with a two-phase iterative erasure-correction process. | en_US |
| dc.description.sponsorship | National Science Foundation (NSF) [ECCS-1500170, SaTC-1813401] | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | IEEE | en_US |
| dc.rights | Copyright © 2019 IEEE | en_US |
| dc.title | Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures | en_US |
| dc.type | Article | en_US |
| dc.contributor.department | Univ Arizona | en_US |
| dc.identifier.journal | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | en_US |
| dc.description.collectioninformation | This 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 repository@u.library.arizona.edu. | en_US |
| dc.eprint.version | Final accepted manuscript | en_US |
| refterms.dateFOA | 2019-11-07T01:28:13Z |
