Probabilistic verification algorithm for linear codes
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915707345698816 |
|---|---|
| author | Li, Mingchao Li, Jiyou |
| author_facet | Li, Mingchao Li, Jiyou |
| contents | In this paper, we propose a probabilistic algorithm suitable for any linear code $C$ to determine whether a given vector $\mathbf{x}$ belongs to $ C$. The algorithm achieves $O(n\log n)$ time complexity, $ O(n^2)$ space complexity and with an error probability less than $1/\mathrm{poly}(n)$ in the asymptotic sense. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_01372 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Probabilistic verification algorithm for linear codes Li, Mingchao Li, Jiyou Information Theory In this paper, we propose a probabilistic algorithm suitable for any linear code $C$ to determine whether a given vector $\mathbf{x}$ belongs to $ C$. The algorithm achieves $O(n\log n)$ time complexity, $ O(n^2)$ space complexity and with an error probability less than $1/\mathrm{poly}(n)$ in the asymptotic sense. |
| title | Probabilistic verification algorithm for linear codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2601.01372 |