Analysis of Absorbing Sets using Cosets and Syndromes

Emily McMillon; Allison Beemer; Christine A. Kelley

doi:10.1109/ISIT44484.2020.9174513

Analysis of Absorbing Sets using Cosets and Syndromes

Emily McMillon, Allison Beemer, Christine A. Kelley

Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Absorbing sets are combinatorial structures in a Tanner graph that have been shown to characterize iterative decoder failure, and particularly error floor behavior, of LDPC codes. In this paper, we examine the connection between absorbing sets and the syndromes of their support vectors. Using this framework, we provide a new characterization of fully absorbing sets, which have been considered the most harmful for iterative decoders. We also show how the sets of absorbing set support vectors appear as translates of codewords in subspaces of the code. These techniques are used to derive new search methods for absorbing sets.

Original language	English (US)
Title of host publication	2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	367-372
Number of pages	6
ISBN (Electronic)	9781728164328
DOIs	https://doi.org/10.1109/ISIT44484.2020.9174513
State	Published - Jun 2020
Event	2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, United States Duration: Jul 21 2020 → Jul 26 2020

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2020-June
ISSN (Print)	2157-8095

Conference

Conference	2020 IEEE International Symposium on Information Theory, ISIT 2020
Country	United States
City	Los Angeles
Period	7/21/20 → 7/26/20

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT44484.2020.9174513

Fingerprint Dive into the research topics of 'Analysis of Absorbing Sets using Cosets and Syndromes'. Together they form a unique fingerprint.

Cite this

McMillon, E., Beemer, A., & Kelley, C. A. (2020). Analysis of Absorbing Sets using Cosets and Syndromes. In 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings (pp. 367-372). [9174513] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2020-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT44484.2020.9174513

Analysis of Absorbing Sets using Cosets and Syndromes. / McMillon, Emily; Beemer, Allison; Kelley, Christine A.

2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2020. p. 367-372 9174513 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2020-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

McMillon, E, Beemer, A & Kelley, CA 2020, Analysis of Absorbing Sets using Cosets and Syndromes. in 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings., 9174513, IEEE International Symposium on Information Theory - Proceedings, vol. 2020-June, Institute of Electrical and Electronics Engineers Inc., pp. 367-372, 2020 IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, United States, 7/21/20. https://doi.org/10.1109/ISIT44484.2020.9174513

@inproceedings{277bfd3d408440d8854bb359e60816da,

title = "Analysis of Absorbing Sets using Cosets and Syndromes",

abstract = "Absorbing sets are combinatorial structures in a Tanner graph that have been shown to characterize iterative decoder failure, and particularly error floor behavior, of LDPC codes. In this paper, we examine the connection between absorbing sets and the syndromes of their support vectors. Using this framework, we provide a new characterization of fully absorbing sets, which have been considered the most harmful for iterative decoders. We also show how the sets of absorbing set support vectors appear as translates of codewords in subspaces of the code. These techniques are used to derive new search methods for absorbing sets.",

author = "Emily McMillon and Allison Beemer and Kelley, {Christine A.}",

note = "Publisher Copyright: {\textcopyright} 2020 IEEE. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; 2020 IEEE International Symposium on Information Theory, ISIT 2020 ; Conference date: 21-07-2020 Through 26-07-2020",

year = "2020",

month = jun,

doi = "10.1109/ISIT44484.2020.9174513",

language = "English (US)",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "367--372",

booktitle = "2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings",

}

TY - GEN

T1 - Analysis of Absorbing Sets using Cosets and Syndromes

AU - McMillon, Emily

AU - Beemer, Allison

AU - Kelley, Christine A.

PY - 2020/6

Y1 - 2020/6

N2 - Absorbing sets are combinatorial structures in a Tanner graph that have been shown to characterize iterative decoder failure, and particularly error floor behavior, of LDPC codes. In this paper, we examine the connection between absorbing sets and the syndromes of their support vectors. Using this framework, we provide a new characterization of fully absorbing sets, which have been considered the most harmful for iterative decoders. We also show how the sets of absorbing set support vectors appear as translates of codewords in subspaces of the code. These techniques are used to derive new search methods for absorbing sets.

AB - Absorbing sets are combinatorial structures in a Tanner graph that have been shown to characterize iterative decoder failure, and particularly error floor behavior, of LDPC codes. In this paper, we examine the connection between absorbing sets and the syndromes of their support vectors. Using this framework, we provide a new characterization of fully absorbing sets, which have been considered the most harmful for iterative decoders. We also show how the sets of absorbing set support vectors appear as translates of codewords in subspaces of the code. These techniques are used to derive new search methods for absorbing sets.

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

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

U2 - 10.1109/ISIT44484.2020.9174513

DO - 10.1109/ISIT44484.2020.9174513

M3 - Conference contribution

AN - SCOPUS:85090420848

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 367

EP - 372

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

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2020 IEEE International Symposium on Information Theory, ISIT 2020

Y2 - 21 July 2020 through 26 July 2020

ER -