Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Cao, Daming"'
This work investigates the phase gain of intelligent reflecting surface (IRS) covert communication over complex-valued additive white Gaussian noise (AWGN) channels. The transmitter Alice intends to transmit covert messages to the legitimate receiver
Externí odkaz:
http://arxiv.org/abs/2210.05084
Autor:
Zhou, Lin, Cao, Daming
We study a hypothesis testing problem with a privacy constraint over a noisy channel and derive the performance of optimal tests under the Neyman-Pearson criterion. The fundamental limit of interest is the privacy-utility tradeoff (PUT) between the e
Externí odkaz:
http://arxiv.org/abs/2006.02869
Autor:
Cao, Daming, Xu, Yinfei
We consider the cache problem introduced by Maddah-ali and Niesen [1] for the $(N,K)=(3,3)$ case, and use the computer-aided approach to derive the tight linear memory-rate trade-off. Two lower bounds $10M+6R\geq 15$ and $5M+4R\geq 9$ are proved, whi
Externí odkaz:
http://arxiv.org/abs/2005.05548
Autor:
Xu, Yinfei, Cao, Daming
In this paper, we consider the problem of secret key generation with one-way communication through both a rate-limited public channel and a rate-limited secure channels where the public channel is from Alice to Bob and Eve and the secure channel is f
Externí odkaz:
http://arxiv.org/abs/2004.05086
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
By proving a strong converse, we strengthen the weak converse result by Salehkalaibar, Wigger and Wang (2017) concerning hypothesis testing against independence over a two-hop network with communication constraints. Our proof follows by judiciously c
Externí odkaz:
http://arxiv.org/abs/1808.05366
Centralized coded caching problem is studied for the two-user scenario, considering heterogeneous cache capacities at the users and private channels from the server to the users, in addition to a shared channel. Optimal caching and delivery strategie
Externí odkaz:
http://arxiv.org/abs/1802.02706
Autor:
Cao, Daming, Tan, Vincent Y. F.
Consider the asymmetric broadcast channel with a random superposition codebook, which may be comprised of constant composition or \iid codewords. By applying Forney's optimal decoder for individual messages and the message pair for the receiver that
Externí odkaz:
http://arxiv.org/abs/1801.05112
Autor:
Cao, Daming, Kang, Wei
In this paper, we study the problem of secret key generation from both correlated sources and a secure channel. We obtain the optimal secret key rate in this problem and show that the optimal scheme is to conduct secret key generation and key distrib
Externí odkaz:
http://arxiv.org/abs/1704.05220
In this paper, we study the probability of successful deception of an uncompressed biometric authentication system with side information at the adversary. It represents the scenario where the adversary may have correlated side information, e.g.,~a pa
Externí odkaz:
http://arxiv.org/abs/1406.3103