"Maximally recoverable codes: The bounded case."

Venkata Gandikota et al. (2017)

> Home

Details and statistics

DOI: 10.1109/ALLERTON.2017.8262862

access: closed

type: Conference or Workshop Paper

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/allerton/GandikotaGTZ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/allerton/GandikotaGTZ17
Venkata Gandikota, Elena Grigorescu, Clayton Thomas, Minshen Zhu:
Maximally recoverable codes: The bounded case. Allerton 2017: 1115-1122

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.