"Codes approaching the Shannon limit with polynomial complexity per ..."

Ilya Dumer, Navid Gharavi (2021)

> Home

Details and statistics

DOI: 10.1109/ISIT45174.2021.9517788

access: closed

type: Conference or Workshop Paper

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isit/DumerG21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/DumerG21
Ilya Dumer, Navid Gharavi:
Codes approaching the Shannon limit with polynomial complexity per information bit. ISIT 2021: 238-243

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.