Go to:
Logótipo
Você está em: Start > Publications > View > LDPC Codes for the Gaussian Wiretap Channel
Map of Premises
Principal
Publication

LDPC Codes for the Gaussian Wiretap Channel

Title
LDPC Codes for the Gaussian Wiretap Channel
Type
Article in International Scientific Journal
Year
2011
Authors
D. Klinc
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
J. Ha
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
S. W. McLaughlin
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
B. Kwak
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Journal
Vol. 6 No. 3
Pages: 532-540
ISSN: 1556-6013
Publisher: IEEE
Indexing
Publicação em ISI Web of Science ISI Web of Science
Scientific classification
FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering
Other information
Abstract (EN): 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/SNRE as 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.
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

Wireless Secrecy Regions With Friendly Jamming (2011)
Article in International Scientific Journal
J. P. Vilela; M. Bloch; J. Barros; S. W. McLaughlin
Uncoordinated Frequency Hopping for Wireless Secrecy Against Non-Degraded Eavesdroppers (2018)
Article in International Scientific Journal
Sá Sousa, J; João P. Vilela
Secure Communication in Stochastic Wireless Networks - Part II: Maximum Rate and Collusion (2012)
Article in International Scientific Journal
P. Pinto; J. Barros; M. Win
Secure Communication in Stochastic Wireless Networks - Part I: Connectivity (2012)
Article in International Scientific Journal
P. Pinto; J. Barros; M. Win
Secrecy Transmission on Parallel Channels: Theoretical Limits and Performance of Practical Codes (2014)
Article in International Scientific Journal
Baldi, M; Chiaraluce, F; Laurenti, N; Tomasin, S; Renna, F

See all (11)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Medicina Dentária da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-08-22 at 21:14:10 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book