Computer Science – Information Theory
Scientific paper
2012-03-12
Computer Science
Information Theory
4 Pages, 2 Figures, Submitted to SPCOM 2012
Scientific paper
In this paper we provide schemes that achieve rates above the 'secrecy capacity' region on a Gaussian wire-tap channel. We take the probability of error as the measure of reliability at the intended receiver and also as the measure of secrecy at the eavesdropper. We show that any rate 0< R < C = 0.5log(1 +P/N) is achievable for this case using the usual random coding-decoding scheme. We also show the relation between probability of error and equivocation as considered in physical layer secrecy problems. We then extend the results to the fading channels.
Rajesh R.
Shah Shahid M.
Sharma Vinod
No associations
LandOfFree
On Secrecy above Secrecy Capacity 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 On Secrecy above Secrecy Capacity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Secrecy above Secrecy Capacity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-488181