Optimally resilient codes for list-decoding from insertions and deletions
We give a complete answer to the following basic question: "What is the maximal fraction of deletions or insertions tolerable by q-ary list-decodable codes with non-vanishing information rate?"
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Artigo |
| 語言: | 英语 |
| 出版: |
2020
|
| 在線閱讀: | https://doi.org/10.1145/3357713.3384262 https://dl.acm.org/doi/pdf/10.1145/3357713.3384262 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|