Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric Wire-Tap Channels

Details Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric Wire-Tap Channels Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric Wire-Tap Channels

2010-05-16

arxiv.org/abs/1005.2759v2

Computer Science

Information Theory

Scientific paper

A polar coding scheme is introduced in this paper for the wire-tap channel. It is shown that the provided scheme achieves the entire rate-equivocation region for the case of symmetric and degraded wire-tap channel, where the weak notion of secrecy is assumed. For the particular case of binary erasure wire-tap channel, an alternative proof is given. The case of general non-degraded wire-tap channels is also considered.

Affiliated with

Also associated with

No associations

Rating

Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric Wire-Tap 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 Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric Wire-Tap Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric Wire-Tap Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-672648