In this paper, we are interested in the performance of a variable-length stop-feedback
(VLSF) code with m optimal decoding times for the binary-input additive white Gaussian …

Horstein, Burnashev, Shayevitz and Feder, Naghshvar et al. and others have studied
sequential transmission of a k-bit message over the binary symmetric channel (BSC) with …

Conventionally, posterior matching is investigated in channel coding and block encoding
contexts–the source symbols are equiprobably distributed and are entirely known by the …

We study variable-length codes for point-to-point discrete memoryless channels with
noiseless unlimited-rate feed-back that occurs in L bursts. We term such codes variable …

We revisit $ M $-ary classification of Gutman (TIT 1989), where one is tasked to determine
whether a testing sequence is generated with the same distribution as one of the $ M …

We study variable-length feedback (VLF) codes with noiseless feedback for discrete
memoryless channels. We present a novel non-asymptotic bound, which analyzes the …

Posterior matching uses variable-length encoding of the message controlled by noiseless
feedback of the received symbols to achieve high rates for short average blocklengths …

Horstein, Burnashev, Shayevitz and Feder, Naghshvar et al. and others have studied
sequential transmission of a K-bit message over the binary symmetric channel (BSC) with …

This paper investigates variable-length stop-feedback codes for memoryless channels in
point-to-point, multiple access, and random access communication scenarios. The proposed …

The aim of this research is to introduce, develop, and evaluate active learning algorithms
that provide near-optimal high-probability bounds on the channel capacity across a discrete …