Metraipolis › archive › dc_c52acefbbdf6

q-ary GRAND — arXiv:2610.10236

Source: arXiv (en)
Original: https://arxiv.org/abs/2610.10236
License (as archived): CC0-1.0
Archived: 2026-10-08T12:46:32.388Z
SHA-256 of the archived text: 5d8a7e7709164e40a2c3681ea47889ca7b3ebb784518e2d0cd89e5a6623d878f
Stable URL of this page: https://metraipolis.com/documento/dc_c52acefbbdf6

How to cite

q-ary GRAND — arXiv:2610.10236 — arXiv (en), https://arxiv.org/abs/2610.10236 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c52acefbbdf6 (Metraipolis archive dc_c52acefbbdf6, sha256 5d8a7e7709164e40a2c3681ea47889ca7b3ebb784518e2d0cd89e5a6623d878f)

BibTeX

@misc{dcc52acefbbdf6,
  title = {q-ary GRAND — arXiv:2610.10236},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.10236},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c52acefbbdf6; sha256 5d8a7e7709164e40a2c3681ea47889ca7b3ebb784518e2d0cd89e5a6623d878f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10236. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We develop q-ary Guessing Random Additive Noise Decoding (GRAND) for linear codes over a q-ary alphabet. The decoder works on a sorted symbol-likelihood array and uses three local child generation rules to generate symbol deviation patterns. We then prove that these rules induce a monotone rooted spanning tree of the full row-index space, so best-first traversal gives maximum-likelihood (ML) decoding under unlimited search. Reed-Solomon simulations verify ML agreement and show the finite-budget performance-complexity tradeoff.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.10236 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T12:17:15.219Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).