Analysis of Absorbing Sets using Cosets and Syndromes

Document Type

Conference Proceeding

Publication Date

6-1-2020

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.

Identifier

85090420848 (Scopus)

ISBN

[9781728164328]

Publication Title

IEEE International Symposium on Information Theory Proceedings

External Full Text Location

https://doi.org/10.1109/ISIT44484.2020.9174513

ISSN

21578095

First Page

367

Last Page

372

Volume

2020-June

This document is currently not available here.

Share

COinS