The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
LDPC Codes for the Gaussian Wiretap Channel
Abstract
This paper presents a coding scheme for the Gaussian wiretap channel based on low-density parity-check (LDPC) codes. The messages are transmitted over punctured bits to hide data from eavesdroppers. The proposed coding scheme is asymptotically effective in the sense that it yields a bit-error rate (BER) very close to 0.5 for an eavesdropper whose signal-to-noise ratio (SNR) is lower than the threshold SNRE, even if the eavesdropper has the ability to use a bitwise maximum a posteriori (MAP) decoder. Such codes also achieve high reliability for the friendly parties provided they have an SNR above a second threshold SNRB. It is shown how asymptotically optimized LDPC codes are designed with differential evolution where the goal is to achieve high reliability between friendly parties while keeping the security gap SNRB/SNREas small as possible to protect against passive eavesdroppers. The proposed coding scheme is encodable in linear time, applicable at finite block lengths, and can be combined with existing cryptographic schemes to deliver improved data security by taking advantage of the stochastic nature of many communication 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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
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×
“S HANNON proved that information-theoretically secure communication is possible only if the communicating parties, say Alice and Bob, share a secret key whose entropy is larger or equal to that of the message [3].”
Background
Cited by
A survey of physical layer security techniques for 5g wireless networks and challenges ahead
Wu, Y., Khisti, A., Xiao, C., Caire, G., Wong, K.-K., & Gao, X. (2018) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2018.2825560 · Cited by 816
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
Metadata
- Authors
- Klinc, D., Ha, J., McLaughlin, S. W., Barros, J., & Kwak, B.-J.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2011-09
- Volume
- 6
- Issue
- 3
- Pages
- 532-540
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2155438308
- Cited by
- 226
- References
- 2
- FWCI
- 13.37
- 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: LDPC Codes for the Gaussian Wiretap Channel. https://app.cochat.ai/papers/10.1109/tifs.2011.2134093
- The paper
- Klinc, D., Ha, J., McLaughlin, S. W., Barros, J., & Kwak, B.-J. (2011). LDPC Codes for the Gaussian Wiretap Channel. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2011.2134093
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.
