From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes

DOI10.1109/TIT.2018.2879823zbMath1431.94145arXiv1711.10539OpenAlexW2900233863MaRDI QIDQ5223914

Amir H. Banihashemi, Ali Dehghan

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.10539

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (1)

Extremal absorbing sets in low-density parity-check codes

This page was built for publication: From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes