On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes

DOI10.1109/TIT.2014.2334657zbMath1360.94378arXiv1308.1259MaRDI QIDQ2986137

Mehdi Karimi, Amir H. Banihashemi

Publication date: 16 May 2017

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (2)

On the complexity of and solutions to the minimum stopping and trapping set problems ⋮ Cospectral bipartite graphs with the same degree sequences but with different number of large cycles

This page was built for publication: On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes