Secure Nested Codes for Type II Wiretap Channels

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear in the Proceedings of the 2007 IEEE Information Theory Workshop on Frontiers in Coding Theory, Lake Tahoe, CA, Septe

Scientific paper

This paper considers the problem of secure coding design for a type II wiretap channel, where the main channel is noiseless and the eavesdropper channel is a general binary-input symmetric-output memoryless channel. The proposed secure error-correcting code has a nested code structure. Two secure nested coding schemes are studied for a type II Gaussian wiretap channel. The nesting is based on cosets of a good code sequence for the first scheme and on cosets of the dual of a good code sequence for the second scheme. In each case, the corresponding achievable rate-equivocation pair is derived based on the threshold behavior of good code sequences. The two secure coding schemes together establish an achievable rate-equivocation region, which almost covers the secrecy capacity-equivocation region in this case study. The proposed secure coding scheme is extended to a type II binary symmetric wiretap channel. A new achievable perfect secrecy rate, which improves upon the previously reported result by Thangaraj et al., is derived for this channel.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Secure Nested Codes for Type II Wiretap Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Secure Nested Codes for Type II Wiretap Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure Nested Codes for Type II Wiretap Channels will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-505579

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.