Metraipolis › archive › dc_57b1e45ae970

Conformal Decode-or-Erase: Certified Spiking Decoding for Short-Packet URLLC — arXiv:2608.15751

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.15751
License (as archived)
CC0-1.0
Archived
2026-10-19T02:13:58.467Z
SHA-256 of the archived text
6f8f3d4865c4da7f2670b889834c1453fd6af7645f66dc8128cc00949d00741d
Stable URL of this page
https://metraipolis.com/documento/dc_57b1e45ae970

How to cite

Conformal Decode-or-Erase: Certified Spiking Decoding for Short-Packet URLLC — arXiv:2608.15751 — arXiv (en), https://arxiv.org/abs/2608.15751 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_57b1e45ae970 (Metraipolis archive dc_57b1e45ae970, sha256 6f8f3d4865c4da7f2670b889834c1453fd6af7645f66dc8128cc00949d00741d)
BibTeX
@misc{dc57b1e45ae970,
  title = {Conformal Decode-or-Erase: Certified Spiking Decoding for Short-Packet URLLC — arXiv:2608.15751},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.15751},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_57b1e45ae970; sha256 6f8f3d4865c4da7f2670b889834c1453fd6af7645f66dc8128cc00949d00741d},
  year = {2026}
}

Archived text

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

Ultra-reliable low-latency communication (URLLC) must deliver short packets within a hard deadline at low error probability. A conventional receiver waits for the full packet before deciding, spending the full latency and energy even though many packets are resolvable well before the deadline. Committing early without a reliability guarantee, however, risks a silent wrong delivery, so the receiver is left choosing between wasted resources and uncontrolled errors. We propose Conformal Decode-or-Erase (CoDE), a spiking neural network (SNN) receiver that resolves this tension. The SNN reads one symbol per channel use and forms, at predetermined checkpoints, a set of candidate messages that provably contains the true one with a prescribed probability. CoDE commits once the set narrows to a singleton and otherwise declares an erasure that triggers hybrid automatic repeat request (HARQ) retransmission. A wrong commit means the true message fell outside that singleton. Hence, the prediction set provides an upper bound on the undetected error rate in a distribution-free manner and for any pretrained SNN and any calibration size. Simulations confirm reliability at roughly half a fixed-length decoder's latency and compute.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-18 in eess.SP).
Categorie arXiv: Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2608.15751 — 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-19T01:25:14.315Z dalla pagina https://arxiv.org/catchup/eess.SP/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).