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]

@inproceedings{0001B18-5,
  title = {Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles},
  author = {Ali Dehghan 0001 and Amir H. Banihashemi},
  year = {2018},
  doi = {10.1109/ISTC.2018.8625273},
  url = {https://doi.org/10.1109/ISTC.2018.8625273},
  researchr = {https://researchr.org/publication/0001B18-5},
  cites = {0},
  citedby = {0},
  pages = {1-5},
  booktitle = {10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, ISTC 2018, Hong Kong, China, December 3-7, 2018},
  publisher = {IEEE},
  isbn = {978-1-5386-7048-4},
}