The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Fundamental Limits of Communication With Low Probability of Detection
Open accessAbstract
This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise (AWGN) channel subject to the constraint that the probability that an adversary who observes the channel outputs can detect the communication is low. In particular, the relative entropy between the output distributions when a codeword is transmitted and when no input is provided to the channel must be sufficiently small. For a DMC whose output distribution induced by the “off” input symbol is not a mixture of the output distributions induced by other input symbols, it is shown that the maximum amount of information that can be transmitted under this criterion scales like the square root of the blocklength. The same is true for the AWGN channel. Exact expressions for the scaling constant are also derived.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“Throughout this paper, we use the letter P to denote input distributions on X and the letter Q to denote output distributions on Y .”
MethodWyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,075
Channel Coding Rate in the Finite Blocklength Regime
Polyanskiy, Y., Poor, H. V., & Verdu, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043769 · Cited by 3,885
Limits of Reliable Communication with Low Probability of Detection on AWGN Channels
Bash, B. A., Goeckel, D., & Towsley, D. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130923 · Cited by 1,075
A general formula for channel capacity
Verdu, S., & Han, T. S. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.335960 · Cited by 779
Information-Spectrum Methods in Information Theory
Han, T. S. (2003) · Stochastic Modelling and Applied Probability · doi:10.1007/978-3-662-12066-8 · Cited by 682
Steganography in Digital Media: Principles, Algorithms, and Applications
Fridrich, J. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9781139192903 · Cited by 570
Covert Communication Over Noisy Channels: A Resolvability Perspective
Bloch, M. R. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2530089 · Cited by 433
An information-theoretic model for steganography
Cachin, C. (2004) · Information and Computation · doi:10.1016/j.ic.2004.02.003 · Cited by 341
Reliable deniable communication: Hiding messages in noise
Che, P. H., Bakshi, M., & Jaggi, S. (2013) · 2013 IEEE International Symposium on Information Theory · doi:10.1109/isit.2013.6620765 · Cited by 300
Information projections revisited
Csiszar, I., & Matus, F. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.810633 · Cited by 169
Effective secrecy: Reliability, confusion and stealth
Hou, J., & Kramer, G. G. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6874903 · Cited by 139
A Capacity Result for Batch Steganography
Ker, A. D. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2006.891319 · Cited by 113
Reliable deniable communication with channel uncertainty
Che, P. H., Bakshi, M., Chan, C., & Jaggi, S. (2014) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2014.6970786 · Cited by 91
Fisher Information Determines Capacity of ε-Secure Steganography
Filler, T., & Fridrich, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04431-1_3 · Cited by 37
Cited by
Covert Communication in the Presence of an Uninformed Jammer
Sobers, T. V., Bash, B. A., Guha, S., Towsley, D., & Goeckel, D. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2720736 · Cited by 449
Covert Communications: A Comprehensive Survey
Chen, X., An, J., Xiong, Z., Xing, C., Zhao, N., Yu, F. R., & Nallanathan, A. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3263921 · Cited by 371
Low Probability of Detection Communication: Opportunities and Challenges
Yan, S., Zhou, X., Hu, J., & Hanly, S. V. (2019) · IEEE Wireless Communications · doi:10.1109/mwc.001.1900057 · Cited by 361
Achieving Covert Wireless Communications Using a Full-Duplex Receiver
Shahzad, K., Zhou, X., Yan, S., Hu, J., Shu, F., & Li, J. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2878014 · Cited by 291
Delay-Intolerant Covert Communications With Either Fixed or Random Transmit Power
Yan, S., He, B., Zhou, X., Cong, Y., & Swindlehurst, A. L. (2019) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2846257 · Cited by 261
Metadata
- Authors
- Wang, L., Wornell, G. W., & Zheng, L.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2016-06
- Volume
- 62
- Issue
- 6
- Pages
- 3493-3503
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W3104101844
- Cited by
- 371
- References
- 17
- FWCI
- 13.87
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.