Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard

Ali Dehghan 0001, Amir H. Banihashemi. Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard. In 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17-22, 2018. pages 1645-1649, IEEE, 2018. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.