State Masking Over a Two-State Compound Channel
From MaRDI portal
Publication:4958256
DOI10.1109/TIT.2021.3096646zbMATH Open1486.94065arXiv2012.01706OpenAlexW3182262125MaRDI QIDQ4958256FDOQ4958256
S. Salehkalaibar, Mehrasa Ahmadipour, Vincent Y. F. Tan, Mohammad Hossein Yassaee
Publication date: 7 September 2021
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We consider fundamental limits for communicating over a compound channel when the state of the channel needs to be masked. Our model is closely related to an area of study known as covert communication that is a setting in which the transmitter wishes to communicate to legitimate receiver(s) while ensuring that the communication is not detected by an adversary. The main contribution in our two-state masking setup is the establishment of bounds on the throughput-key region when the constraint that quantifies how much the states are masked is defined to be the total variation distance between the two channel-induced distributions. For the scenario in which the key length is infinite, we provide sufficient conditions for when the bounds to coincide for the throughput, which follows the square-root law. Numerical examples, including that of a Gaussian channel, are provided to illustrate our results.
Full work available at URL: https://arxiv.org/abs/2012.01706
This page was built for publication: State Masking Over a Two-State Compound Channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958256)
