Shannon's Secrecy System With Informed Receivers and its Application to Systematic Coding for Wiretapped Channels
From MaRDI portal
Publication:3604540
DOI10.1109/TIT.2008.921858zbMATH Open1328.94036arXivcs/0611129OpenAlexW2049651362MaRDI QIDQ3604540FDOQ3604540
Authors: Neri Merhav 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Shannon's secrecy system is studied in a setting, where both the legitimate decoder and the wiretapper have access to side information sequences correlated to the source, but the wiretapper receives both the coded information and the side information via channels that are more noisy than the respective channels of the legitmate decoder, which in turn, also shares a secret key with the encoder. A single--letter characterization is provided for the achievable region in the space of five figures of merit: the equivocation at the wiretapper, the key rate, the distortion of the source reconstruction at the legitimate receiver, the bandwidth expansion factor of the coded channels, and the average transmission cost (generalized power). Beyond the fact that this is an extension of earlier studies, it also provides a framework for studying fundamental performance limits of systematic codes in the presence of a wiretap channel. The best achievable performance of systematic codes is then compared to that of a general code in several respects, and a few examples are given.
Full work available at URL: https://arxiv.org/abs/cs/0611129
Coding theorems (Shannon theory) (94A24) Cryptography (94A60) Channel models (including quantum) in information and communication theory (94A40)
Cited In (2)
This page was built for publication: Shannon's Secrecy System With Informed Receivers and its Application to Systematic Coding for Wiretapped Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604540)
