"Computing the Asymptotic Expected Multiplicity of Leafless Elementary ..."

Ali Dehghan, Amir H. Banihashemi (2018)

> Home

Details and statistics

DOI: 10.1109/ISTC.2018.8625273

access: closed

type: Conference or Workshop Paper

metadata version: 2019-01-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/istc/0001B18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/istc/0001B18
Ali Dehghan, Amir H. Banihashemi:
Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles. ISTC 2018: 1-5

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.