Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

arXiv:2407.13898 · cs.IT, cs.CR, math.IT · Submitted 2024-07-18 · Read on arXiv

cs.IT, cs.CR, math.IT

Submitted: 2024-07-18

Updated: 2026-09-21

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Scaling Laws — 5× in this paper · explained in 4 episodes
• Likelihood Ratio Test — 3× in this paper
• Accuracy — 1× in this paper · explained in 1 episode
• Decode — 1× in this paper · explained in 2 episodes
• IEEE International Conference on Communications — 1× in this paper

Related papers

• Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
• Discrepancy for Random Linear Codes
• A New Approach to Code Smoothing Bounds
• Contextual Memory-Enhanced Source Coding for Low-SNR Communications
• Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels
• Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions