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

DOI10.1109/TIT.2019.2904988zbMath1432.94200arXiv1711.10543OpenAlexW2963330564MaRDI QIDQ5224073

Ali Dehghan, Amir H. Banihashemi

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.10543

zbMATH Keywords

low-density parity-check (LDPC) codesadditive white Gaussian (AWGN) channelLeafless elementary trapping sets (LETSs)

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25) Decoding (94B35)

Related Items (1)

On the complexity of and solutions to the minimum stopping and trapping set problems

This page was built for publication: Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes