Covert Capacity of Degraded Broadcast Channels
arXiv:2605.093532.2
Predicted impact top 97% in IT · last 90 daysOriginality Highly original
AI Analysis
Provides the first capacity result for covert communication over degraded broadcast channels, addressing a fundamental problem in covert information theory.
The paper derives the capacity region of the degraded broadcast channel under covert communication constraints, showing that time-sharing is suboptimal and superposition coding yields improved rates.
We derive the capacity region of the degraded broadcast channel (DBC) subject to the constraint that the communication is not detected by an adversary, the Warden. Our capacity result is in a computable form and numerical results show that time-sharing is suboptimal in general, and improved rates can be obtained through superposition coding.