"Lower bounds on the graphical complexity of finite-length LDPC codes."

Igal Sason (2009)

> Home

Details and statistics

DOI: 10.1109/ISIT.2009.5205822

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isit/Sason09a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/Sason09a
Igal Sason:
Lower bounds on the graphical complexity of finite-length LDPC codes. ISIT 2009: 219-223

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.