A Finite-Blocklength Analysis for ORBGRAND
This paper presents a finite-blocklength analysis for Ordered Reliability Bits GRAND (ORBGRAND) by deriving a random-coding union bound and characterizing its decoding metrics to establish a second-order achievable-rate expansion with a normal approximation, thereby quantifying its performance at short-to-moderate blocklengths where prior results were limited to asymptotic regimes.