Skip to content
Preprint

Variable-Length Feedback Coding With Universal Decoding and Bandit Channel Selection

Oct 2026 · 0 citations · 42 references
Computer Science Mathematics

TL;DR

Two joint coding and channel-selection schemes for variable-length feedback (VLF) coding over additive white Gaussian noise channels whose noise variances are unknown to both terminals but lie in a known interval are studied.

Abstract

We study variable-length feedback (VLF) coding over $K$ additive white Gaussian noise (AWGN) channels whose noise variances are unknown to both terminals but lie in a known interval. The receiver selects one channel at each time, conveys the selection over noiseless feedback, and must learn the channel qualities while decoding, to avoid overusing suboptimal channels. This setting, which we call the VLF-Bandit problem, combines VLF coding, universal decoding, and bandit channel selection. We develop two joint coding and channel-selection schemes. The VLSF-Bandit scheme is a single-phase variable-length stop-feedback (VLSF) scheme based on a Gaussian random codebook, a score formed from a ratio of likelihood mixtures, and the asymptotically optimal $\text{kl-UCB}^{++}$ bandit algorithm applied to the received power. The VLF-Bandit scheme sends the message in packets by Schalkwijk--Kailath transmission, uses its normalized outputs as noise samples to learn the variances, and lets its exploration packets carry message bits. We prove second-order achievability bounds for both schemes, which are first-order optimal. In the logarithm of the achievable codebook size, the magnitude of the $\log N$ coefficient, with $N$ the average decoding time, is a baseline of one plus a channel-exploration term for VLSF-Bandit. For VLF-Bandit, this magnitude is smaller, with a universal-decoding term replacing the baseline and a smaller channel-exploration term. The VLF-Bandit bound improves on the universal VLF bound of Yavas and Tan (2025) for $K=1$ and on the bound of an explore-then-commit strategy whenever $K\geq2$.

View source

Similar papers

Sep 2026

A Tight Second-Order Converse Bound for Variable-Length Feedback Codes

A converse is derived, establishing the second-order fundamental limit for every positive-capacity discrete memoryless channel with finite $C_1$, which covers the moderate-deviations and error-exponent regimes, including polynomially decaying error probabilities.

Recep Can Yavas · 0 citations
Open access Oct 2026

Frozen-Bit Jammer Steering (FB-JS): Mitigating Multi-Band Channel Erasures in 5G Polar Codes

Simulation results confirm that FB-JS successfully isolates targeted jamming erasures and maintains baseline-equivalent error performance under heavy multi-band interference, providing a resilient, low-complexity physical-layer defense for tactical 5G/6G communication networks.

Haider A. Abdulkarim · 0 citations
Preprint Oct 2026

Joint Identification, Transmission, and Sensing over State-Dependent Channels with Noiseless Feedback

The achievability proof combines constant-composition transmission coding, output partitioning, and combinatorial identification coding, while the converse follows from an averaged-channel reduction, distortion lower bounds, and feedback-identification converse arguments.

Vida Gholamian, Marcel A. Mross, R. Ferrara et al. · 0 citations
Sep 2026

Joint Source-Channel Coding of Gaussian Sources over Block Erasure Channels: Nonasymptotic Bounds and Channel-Uniform Normal Approximations

We study finite-blocklength lossy transmission of a Gaussian memoryless source over memoryless, possibly nonstationary block erasure channels under an excess mean-squared distortion criterion. We derive computable nonasymptotic achievability and converse bounds and establish matching third-order, channel-uniform normal...

A. Mahmood · 0 citations
Oct 2026

Reliability, Latency, and Complexity Tradeoffs of Short Block Channel Codes for Narrowband Radio Channels

Short-frame narrowband radio links require forward error correction that jointly balances reliability, decoding latency, and complexity. This paper compares a Long-Term Evolution (LTE) tail-biting convolutional code, the $\mathbf{5}^{\text {th }}$ Generation New Radio (5G NR) Low-Density Parity-Check (LDPC) code, and t...

Rastislav Ledaj, M. Babjak, J. Kurty et al. · 0 citations
Preprint Oct 2026

Learning Joint Synchronization, Channel Estimation, and Decoding: Comparison with a Finite-Blocklength Achievability Bound

Learned schemes that jointly perform tasks such as synchronization and decoding have achieved promising results for short-packet communication. However, it remains unclear how close their performance is to information-theoretic bounds. To investigate this question, we extend the turbo autoencoder (TurboAE) proposed in...

Bin-Chen-Bin Chen, G. Durisi, C. Häger · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.