Computer Science – Information Theory
Scientific paper
2010-08-11
Computer Science
Information Theory
24 pages, Submitted to IEEE Transactions on Information Theory
Scientific paper
The Shannon cipher system is studied in the context of general sources using a notion of computational secrecy introduced by Merhav & Arikan. Bounds are derived on limiting exponents of guessing moments for general sources. The bounds are shown to be tight for iid, Markov, and unifilar sources, thus recovering some known results. A close relationship between error exponents and correct decoding exponents for fixed rate source compression on the one hand and exponents for guessing moments on the other hand is established.
Hanawal Manjesh Kumar
Sundaresan Rajesh
No associations
LandOfFree
The Shannon Cipher System with a Guessing Wiretapper: General Sources 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 The Shannon Cipher System with a Guessing Wiretapper: General Sources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Shannon Cipher System with a Guessing Wiretapper: General Sources will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-480672