1 citations · 1 across the 1 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2024★ 1 cited
Bounds on Covert Capacity with Sub-Exponential Random Slot Selection
Shi-Yuan Wang, Keerthi S. K. Arumugam, Matthieu R. Bloch
We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels and Additive White Gaussian Noise channels, in which a tra…
cs.IT2023★ 1 cited
Covert Online Decision Making: From Sequential Hypothesis Testing to Stochastic Bandits
Meng-Che Chang, Matthieu R. Bloch
We study the problem of covert online decision-making in which an agent attempts to identify a parameter governing a system by probing the system while escaping detection from an a…