Technical Program

Paper Detail

Paper IDC.4.4
Paper Title Analysis of Absorbing Sets using Cosets and Syndromes
Authors Emily McMillon, University of Nebraska - Lincoln, United States; Allison Beemer, New Jersey Institute of Technology, United States; Christine A. Kelley, University of Nebraska - Lincoln, United States
Session C.4: LDPC Codes
Presentation Lecture
Track Coding for Communications
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
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.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!