External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles

Ali Dehghan 0001, Amir H. Banihashemi. Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles. In 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, ISTC 2018, Hong Kong, China, December 3-7, 2018. pages 1-5, IEEE, 2018. [doi]

Abstract

Abstract is missing.

runs on