"Computing extensions of linear codes using a greedy algorithm."

Markus Grassl, Sunghyu Han (2012)

> Home

Details and statistics

DOI: 10.1109/ISIT.2012.6283537

access: closed

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isit/GrasslH12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/GrasslH12
Markus Grassl, Sunghyu Han:
Computing extensions of linear codes using a greedy algorithm. ISIT 2012: 1568-1572

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.