"Hardness of approximating the minimum distance of a linear code."

Ilya Dumer, Daniele Micciancio, Madhu Sudan (2003)

> Home

Details and statistics

DOI: 10.1109/TIT.2002.806118

access: closed

type: Journal Article

metadata version: 2024-02-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/DumerMS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/DumerMS03
Ilya Dumer, Daniele Micciancio, Madhu Sudan:
Hardness of approximating the minimum distance of a linear code. IEEE Trans. Inf. Theory 49(1): 22-37 (2003)

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.