Analysis of Absorbing Sets using Cosets and Syndromes

Emily McMillon, Allison Beemer, Christine A. Kelley

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publication2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages367-372
Number of pages6
ISBN (Electronic)9781728164328
DOIs
StatePublished - Jun 2020
Event2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, United States
Duration: Jul 21 2020Jul 26 2020

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2020-June
ISSN (Print)2157-8095

Conference

Conference2020 IEEE International Symposium on Information Theory, ISIT 2020
CountryUnited States
CityLos Angeles
Period7/21/207/26/20

ASJC Scopus subject areas

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

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

Cite this