Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps
This paper presents a constructive framework for designing optimal classical random access codes (RACs) under both average and worst-case criteria, deriving explicit solutions for general parameters and closed-form optimal encoders for the case that also achieve conjectured bounds for their quantum counterparts, while revealing a potential significant performance gap between classical and quantum codes in the worst-case nonasymptotic regime.