Soft GRAND under Channel Switching and Drift
Abstract
Under channel switching or drift, the posterior used to order Guessing Random Additive Noise Decoding (GRAND) queries can differ from the matched correction posterior, increasing query rank and finite-budget error. We bound log query rank by matched posterior self-information plus positive log-posterior mismatch; exact random-subset collision probabilities bound GRAND with abandonment (GRANDAB) error. Under switching, a state-path mixture achieves vanishing error uniformly over admissible paths below the minimum constituent capacity when log path-class size is sublinear and uniform input is capacity achieving. Under drift, pilot refresh bounds mismatch and yields a continuous refresh-period minimizer. Generalized-Gaussian BPSK simulations evaluate both regimes.
Related
- Soft GRAND under Channel Uncertainty: Minimax Posterior-Envelope Ordering and Gallager-Exponent Preservation
- Soft-Output GRAND-Aided Macrosymbol
- Learnt Attacks on Quantum Key Distribution under Channel Noise and Device Drift
- Sur la représentation des entiers par des formes cyclotomiques de grand degré
- Wolff Potential and Birkhoff's Ergodic Theorem in Grand Variable Herz Spaces
BibTeX
@misc{razeghi2026soft,
title = {{Soft GRAND under Channel Switching and Drift}},
author = {Behrooz Razeghi},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2608.22685},
eprint = {2608.22685},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.22685},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Soft GRAND under Channel Switching and Drift
AU - Behrooz Razeghi
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2608.22685
UR - https://arxiv.org/abs/2608.22685
AB - Under channel switching or drift, the posterior used to order Guessing Random Additive Noise Decoding (GRAND) queries can differ from the matched correction posterior, increasing query rank and finite-budget error. We bound log query rank by matched posterior self-information plus positive log-posterior mismatch; exact random-subset collision probabilities bound GRAND with abandonment (GRANDAB) error. Under switching, a state-path mixture achieves vanishing error uniformly over admissible paths below the minimum constituent capacity when log path-class size is sublinear and uniform input is capacity achieving. Under drift, pilot refresh bounds mismatch and yields a continuous refresh-period minimizer. Generalized-Gaussian BPSK simulations evaluate both regimes.
ER -