Abstract
We have proved a coding theorem for the discrete memoryless wiretap channel with side information. Extending the result to the Gaussian case, an achievable rate equivocation region is given by using a strategy similar to Costa's method on dirty paper channel. In this paper, we propose an extended region for the Gaussian wiretap channel with side information. On the other hand, it is well known that, to yield the optimal rate, Costa only considers the situation when the codeword sent by the encoder is independent of side information. Here we will show that, for the wiretap channel, to yield higher rate with the same equivocation, it might be a better choice to send a codeword dependent of side information in some cases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
