State Masking Over a Two-State Compound Channel
| Autor: | Sadaf Salehkalaibar, Mohammad Hossein Yassaee, Mehrasa Ahmadipour, Vincent Y. F. Tan |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
FOS: Computer and information sciences
Computer science Information Theory (cs.IT) Computer Science - Information Theory Transmitter Throughput State (functional analysis) Library and Information Sciences Topology Upper and lower bounds Computer Science Applications Constraint (information theory) Total variation Covert Information Systems Communication channel Computer Science::Information Theory |
| Popis: | 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. arXiv admin note: substantial text overlap with arXiv:1906.06675 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|