The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Secure space-time communication
Abstract
Network security is important for information protection in open, secure, or covert communications. One such requirement is to achieve high-rate communications between clients, e.g., terminals or sensors, in the network while hiding information about the transmitted symbols, signal activity, or other sensitive data from an unintended receiver, e.g., an eavesdropper. For wireless links, the single-user capacity advantages of deployment of multiple antennas at the transmitter is well known. One of the principal conclusions of this paper is that proper exploitation of space-time diversity at the transmitter can also enhance information security and information-hiding capabilities. In particular, we show that significant gains are achievable when the transmitter and the client receiver are both informed about their channel while the transmitter and eavesdropper receiver are uniformed about their channel. More generally, we compare capacity limits for both informed and uninformed transmitter and informed receiver scenarios subject to low probability of intercept (LPI) and low probability of detection (LPD) constraints. For several general cases, we can characterize the LPI- and LPD-optimal transmitted source distributions and compare them to the standard optimal source distribution satisfying a power constraint. We assume the standard quasi-static flat Rayleigh-fading channel model for the transmitter-receiver pairs. This paper is a step toward answering the fundamental question: what are the qualitative and quantitative differences between the information-carrying capabilities of open space-time channels versus secure space-time channels?
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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 3×
“This LPI condition is equivalent to the perfect secrecy condition in cryptography [30].”
BackgroundInfluential
Cited by
Guaranteeing Secrecy using Artificial Noise
Goel, S., & Negi, R. (2008) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2008.060848 · Cited by 1,917
The Relay–Eavesdropper Channel: Cooperation for Secrecy
Lai, L., & El Gamal, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928272 · Cited by 774
Liu, Y., Chen, H.-H., & Wang, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2598968 · Cited by 698
Hiding information in noise: fundamental limits of covert wireless communication
Bash, B. A., Goeckel, D., Towsley, D., & Guha, S. (2015) · IEEE Communications Magazine · doi:10.1109/mcom.2015.7355562 · Cited by 388
Using the physical layer for wireless authentication in time-variant channels
Xiao, L., Greenstein, L., Mandayam, N., & Trappe, W. (2008) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2008.070194 · Cited by 384
Metadata
- Authors
- Hero, A. O.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2003-12
- Volume
- 49
- Issue
- 12
- Pages
- 3235-3249
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2145577744
- Cited by
- 294
- References
- 1
- FWCI
- 4.69
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Secure space-time communication. https://app.cochat.ai/papers/10.1109/tit.2003.820010
- The paper
- Hero, A. O. (2003). Secure space-time communication. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2003.820010
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.