The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Secrecy Capacity of Wireless Channels
Abstract
We consider the transmission of confidential data over wireless channels with multiple communicating parties. Based on an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through another independent quasi-static fading channel, we define the secrecy capacity in terms of outage probability and provide a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. In sharp contrast with known results for Gaussian wiretap channels (without feedback), our contribution shows that in the presence of fading information-theoretic security is achievable even when the eavesdropper has a better average signal-to-noise ratio (SNR) than the legitimate receiver - fading thus turns out to be a friend and not a foe.
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
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
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×
“The theoretical basis for this information-theoretic approach, which builds on Shannon’s notion of perfect secrecy [5], was laid by Wyner [6] and later by Csiszár and Körner [7], who proved in seminal papers that there exist channel codes guaranteeing both robustness to transmission errors and a prescribed degree of d…”
Background
Research works printed but not linked: 7
- thangaraj, 2004, Capacity achieving codes for the wire tap channel with applications to quantum key distribution, CcRR vol
- 10.1109/18.256484 · DOI · Paper page
- 10.1109/TIT.1978.1055892 · DOI · Paper page
- 10.1002/j.1538-7305.1975.tb02040.x · DOI · Paper page
- 10.1109/ITW.2006.1633793 · doi:10.1109/itw.2006.1633793
- leung-yan-cheeng, 1978, The gaussian wiretap channel, IEEE Trans on Inform Theory, 24, 451456
- rappaport, 2001, Wireless Communications Principles and Practice
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
Secure Communication Over Fading Channels
Liang, Y., Poor, H. V., & Shamai, S. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921678 · Cited by 937
Liu, Y., Chen, H.-H., & Wang, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2598968 · Cited by 698
A Survey on Multiple-Antenna Techniques for Physical Layer Security
Chen, X., Ng, D. W. K., Gerstacker, W. H., & Chen, H.-H. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2633387 · Cited by 474
The Gaussian Multiple Access Wire-Tap Channel
Tekin, E., & Yener, A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2006422 · Cited by 317
Metadata
- Authors
- Barros, J., & D. Rodrigues, M. R.
- Venue
- 2006 IEEE International Symposium on Information Theory
- Publisher
- IEEE
- Published
- 2006-07
- Pages
- 356-360
- OpenAlex
- W2102654676
- Cited by
- 824
- References
- 2
- FWCI
- 40.87
- Type
- conference paper
- 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: Secrecy Capacity of Wireless Channels. https://app.cochat.ai/papers/10.1109/isit.2006.261613
- The paper
- Barros, J., & D. Rodrigues, M. R. (2006). Secrecy Capacity of Wireless Channels. 2006 IEEE International Symposium on Information Theory. https://doi.org/10.1109/isit.2006.261613
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.
