"Maximum-likelihood decoding of Reed-Solomon codes is NP-hard."

Venkatesan Guruswami, Alexander Vardy (2005)

> Home

Details and statistics

DOI: 10.1109/TIT.2005.850102

access: closed

type: Journal Article

metadata version: 2020-03-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/GuruswamiV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/GuruswamiV05
Venkatesan Guruswami, Alexander Vardy:
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. IEEE Trans. Inf. Theory 51(7): 2249-2256 (2005)

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.