Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes

11/28/2017
by   Ali Dehghan, et al.
0

Leafless elementary trapping sets (LETSs) are known to be the problematic structures in the error floor region of low-density parity-check (LDPC) codes over the additive white Gaussian (AWGN) channel under iterative decoding algorithms. While problems involving the general category of trapping sets, and the subcategory of elementary trapping sets (ETSs), have been shown to be NP-hard, similar results for LETSs, which are a subset of ETSs are not available. In this paper, we prove that, for a general LDPC code, finding a LETS of a given size a with minimum number of unsatisfied check nodes b is NP-hard to approximate with any guaranteed precision. We also prove that finding the minimum size a of a LETS with a given b is NP-hard to approximate. Similar results are proved for elementary absorbing sets, a popular subcategory of LETSs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/31/2022

Identities in twisted Brauer monoids

We show that it is co-NP-hard to check whether a given semigroup identit...
research
03/21/2018

Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size

One of the phenomena that influences significantly the performance of lo...
research
07/06/2023

Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods

Elementary trapping sets (ETSs) are the main culprits for the performanc...
research
10/17/2020

Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard

We consider the computational complexity of winning this turn (mate-in-1...
research
03/08/2022

Diagonal distance of quantum codes and hardness of the minimum distance problem

The diagonal distance or graph distance is an important parameter of a q...
research
02/16/2022

On the Complexity of Some Variations of Sorting by Transpositions

One of the main challenges in Computational Biology is to find the evolu...
research
12/22/2020

An Improved Algorithm for Coarse-Graining Cellular Automata

In studying the predictability of emergent phenomena in complex systems,...

Please sign up or login with your details

Forgot password? Click here to reset