Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures

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 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.

Original languageEnglish (US)
Title of host publication2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages71-75
Number of pages5
ISBN (Electronic)9781538692912
DOIs
StatePublished - Jul 2019
Event2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France
Duration: Jul 7 2019Jul 12 2019

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2019-July
ISSN (Print)2157-8095

Conference

Conference2019 IEEE International Symposium on Information Theory, ISIT 2019
CountryFrance
CityParis
Period7/7/197/12/19

Fingerprint

Quasi-cyclic Codes
LDPC Codes
Burst
Binary
Adjacency
Modulo
Cycle
Graph in graph theory
Class

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Xiao, X., Vasić, B., Lin, S., Abdel-Ghaffar, K., & Ryan, W. E. (2019). Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings (pp. 71-75). [8849853] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2019.8849853

Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures. / Xiao, Xin; Vasić, Bane; Lin, Shu; Abdel-Ghaffar, Khaled; Ryan, William E.

2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. p. 71-75 8849853 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July).

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

Xiao, X, Vasić, B, Lin, S, Abdel-Ghaffar, K & Ryan, WE 2019, Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures. in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849853, IEEE International Symposium on Information Theory - Proceedings, vol. 2019-July, Institute of Electrical and Electronics Engineers Inc., pp. 71-75, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 7/7/19. https://doi.org/10.1109/ISIT.2019.8849853
Xiao X, Vasić B, Lin S, Abdel-Ghaffar K, Ryan WE. Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. p. 71-75. 8849853. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2019.8849853
Xiao, Xin ; Vasić, Bane ; Lin, Shu ; Abdel-Ghaffar, Khaled ; Ryan, William E. / Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures. 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 71-75 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{0c0e2cdc18b6414c91bffaeefa2eb373,
title = "Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures",
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.",
author = "Xin Xiao and Bane Vasić and Shu Lin and Khaled Abdel-Ghaffar and Ryan, {William E.}",
year = "2019",
month = "7",
doi = "10.1109/ISIT.2019.8849853",
language = "English (US)",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "71--75",
booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",

}

TY - GEN

T1 - Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures

AU - Xiao, Xin

AU - Vasić, Bane

AU - Lin, Shu

AU - Abdel-Ghaffar, Khaled

AU - Ryan, William E.

PY - 2019/7

Y1 - 2019/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85073160394&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85073160394&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2019.8849853

DO - 10.1109/ISIT.2019.8849853

M3 - Conference contribution

AN - SCOPUS:85073160394

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 71

EP - 75

BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -