Covert Capacity of Non-Coherent Rayleigh-Fading Channels

The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the covert capacity is achieved with an amplitude-constrained input distribution that consists of a finite number of mass points including one at zero and numerically tractable bounds are provided. It is also conjectured that distributions with two mass points in fixed locations are optimal.

[1]  R. Durrett.  Probability: Theory and Examples , 1993 .

[2]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[3]  Jie Hou,et al.  Coding for Relay Networks and Effective Secrecy for Wire-tap Channels , 2014 .

[4]  Matthieu R. Bloch,et al.  Covert Communication Over Noisy Channels: A Resolvability Perspective , 2015, IEEE Transactions on Information Theory.

[5]  Xiangyun Zhou,et al.  Gaussian Signalling for Covert Communications , 2018, IEEE Transactions on Wireless Communications.

[6]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[7]  Masahito Hayashi,et al.  Quantum Wiretap Channel With Non-Uniform Random Number and Its Exponent and Equivocation Rate of Leaked Information , 2012, IEEE Transactions on Information Theory.

[8]  Boulat A. Bash,et al.  Limits of Reliable Communication with Low Probability of Detection on AWGN Channels , 2012, IEEE Journal on Selected Areas in Communications.

[9]  Donald F. Towsley,et al.  Covert communication over classical-quantum channels , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[10]  Saikat Guha,et al.  Covert Communication in the Presence of an Uninformed Jammer , 2016, IEEE Transactions on Wireless Communications.

[11]  Lizhong Zheng,et al.  Limits of low-probability-of-detection communication over a discrete memoryless channel , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[12]  Mehrdad Tahmasbi,et al.  Codes for Covert Communication over Additive White Gaussian Noise Channels , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[13]  Xiangyun Zhou,et al.  Delay-Intolerant Covert Communications With Either Fixed or Random Transmit Power , 2019, IEEE Transactions on Information Forensics and Security.

[14]  Matthieu R. Bloch,et al.  First- and Second-Order Asymptotics in Covert Communication , 2017, IEEE Transactions on Information Theory.

[15]  Joel G. Smith,et al.  The Information Capacity of Amplitude- and Variance-Constrained Scalar Gaussian Channels , 1971, Inf. Control..

[16]  Anil K. Bera,et al.  Maximum entropy autoregressive conditional heteroskedasticity model , 2009 .

[17]  E. Stein,et al.  Real Analysis: Measure Theory, Integration, and Hilbert Spaces , 2005 .

[18]  Lizhong Zheng,et al.  Fundamental Limits of Communication With Low Probability of Detection , 2015, IEEE Transactions on Information Theory.

[19]  Donald F. Towsley,et al.  Covert communications on continuous-time channels in the presence of jamming , 2017, 2017 51st Asilomar Conference on Signals, Systems, and Computers.

[20]  Saikat Guha,et al.  Quantum-secure covert communication on bosonic channels , 2015, Nature Communications.

[21]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[22]  D. Luenberger.  Optimization by Vector Space Methods , 1968 .

[23]  Mayank Bakshi,et al.  Reliable deniable communication: Hiding messages in noise , 2013, 2013 IEEE International Symposium on Information Theory.

[24]  Jun Li,et al.  Covert Communication Achieved by a Greedy Relay in Wireless Networks , 2017, IEEE Transactions on Wireless Communications.

[25]  Donald F. Towsley,et al.  Covert Communication Gains From Adversary’s Ignorance of Transmission Time , 2014, IEEE Transactions on Wireless Communications.

[26]  A. Fokas,et al.  Complex Variables: Introduction and Applications , 1997 .

[27]  Ligong Wang.  Optimal throughput for covert communication over a classical-quantum channel , 2016, 2016 IEEE Information Theory Workshop (ITW).

[28]  Ibrahim C. Abou-Faycal,et al.  The capacity of discrete-time memoryless Rayleigh-fading channels , 2001, IEEE Trans. Inf. Theory.