An achievable region for the Gaussian wiretap channel with side information

In this correspondence, we extend the Gaussian wiretap channel model introduced by Leung-Yan-Cheong and Hellman to the Gaussian wiretap channel with side information by introducing additive white Gaussian interference in the main channel, which is available to the encoder in advance. This model is a...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2006-05, Vol.52 (5), p.2181-2190
Main Authors: Mitrpant, C., Vinck, A.J.H., Yuan Luo
Format: Article
Language:English
Subjects:
Applied sciences
Asymptotic properties
Channels
Coding
Coding, codes
Communication systems
Detection, estimation, filtering, equalization, prediction
Dirty-paper channel
Encoders
Entropy
Exact sciences and technology
Gaussian
Gaussian wiretap channel
Gaussian wiretap channel with side information
Information rates
Information, signal and communications theory
Interference
Lower bounds
Mathematics
Memoryless systems
Optimization
perfect secrecy
Random variables
Secret
Signal and communications theory
Signal, noise
Statistical distributions
Strategy
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this correspondence, we extend the Gaussian wiretap channel model introduced by Leung-Yan-Cheong and Hellman to the Gaussian wiretap channel with side information by introducing additive white Gaussian interference in the main channel, which is available to the encoder in advance. This model is also an extension of the dirty-paper channel introduced by Costa since its main channel is the dirty-paper channel. A perfect-secrecy-achieving coding strategy for the model is proposed. It is used to derive achievable rates with asymptotic perfect secrecy and an achievable rate-equivocation region. The achievable rates with asymptotic perfect-secrecy are then compared to upper and lower bounds. The comparison indicates that the proposed coding strategy is optimal in some cases.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2006.872968