Distributed Channel Synthesis
Reads0
Chats0
TLDR
This paper characterizes the optimal tradeoff between the amount of common randomness used and the required rate of description and generalizes and strengthens a soft covering lemma, known in the literature for its role in quantifying the resolvability of a channel.Abstract:
Two familiar notions of correlation are rediscovered as the extreme operating points for distributed synthesis of a discrete memoryless channel, in which a stochastic channel output is generated based on a compressed description of the channel input. Wyner's common information is the minimum description rate needed. However, when common randomness independent of the input is available, the necessary description rate reduces to Shannon's mutual information. This paper characterizes the optimal tradeoff between the amount of common randomness used and the required rate of description. We also include a number of related derivations, including the effect of limited local randomness, rate requirements for secrecy, applications to game theory, and new insights into common information duality. Our proof makes use of a soft covering lemma, known in the literature for its role in quantifying the resolvability of a channel. The direct proof (achievability) constructs a feasible joint distribution over all parts of the system using a soft covering, from which the behavior of the encoder and decoder is inferred, with no explicit reference to joint typicality or binning. Of auxiliary interest, this paper also generalizes and strengthens this soft covering tool.read more
Citations
More filters
Journal ArticleDOI
Covert Communication Over Noisy Channels: A Resolvability Perspective
TL;DR: A coding scheme based on the principle of channel resolvability is developed, which proves that if the receiver's channel is better than the warden's channel, it is possible to communicate on the order of √n reliable and covert bits over n channel uses without a secret key.
Journal ArticleDOI
Covert Communication over Noisy Channels: A Resolvability Perspective
TL;DR: In this article, the authors considered the problem of channel resolvability with respect to a warden, who observes the signals through another discrete memoryless channel, and showed that the receiver's channel is better than the warden's channel in a sense that we make precise.
Posted Content
Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities
TL;DR: In this article, a unified treatment of single and multi-user problems in Shannon's information theory is presented, where the error probabilities for various problems are bounded above by a non-vanishing constant and the spotlight is shone on achievable coding rates as functions of the growing blocklength.
Journal ArticleDOI
Achievability Proof via Output Statistics of Random Binning
TL;DR: A new and ubiquitous framework for establishing achievability results in network information theory problems that uses random binning arguments and is based on a duality between channel and source coding problems, which allows for proving coordination and strong secrecy problems.
Journal ArticleDOI
Error-Control Coding for Physical-Layer Secrecy
TL;DR: System engineers are provided with explicit tools to build simple secrecy codes in order to stimulate interest and foster their integration in communication system prototypes, and the open challenges and opportunities faced for the integration of these codes in practical systems are highlighted.
References
More filters
Book
Network Information Theory
Abbas El Gamal,Young-Han Kim +1 more
TL;DR: In this article, a comprehensive treatment of network information theory and its applications is provided, which provides the first unified coverage of both classical and recent results, including successive cancellation and superposition coding, MIMO wireless communication, network coding and cooperative relaying.
Information Theory: Coding theorems for discrete memoryless systems, Second Edition
Janos Korner,Imre Csiszár +1 more
Journal ArticleDOI
Secret key agreement by public discussion from common information
TL;DR: It is shown that such a secret key agreement is possible for a scenario in which all three parties receive the output of a binary symmetric source over independent binary asymmetric channels, even when the enemy's channel is superior to the other two channels.
Book
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Thomas M. Cover,Joy A. Thomas +1 more
Journal ArticleDOI
Common randomness in information theory and cryptography. I. Secret sharing
Rudolf Ahlswede,Imre Csiszár +1 more
TL;DR: As the first part of a study of problems involving common randomness at distance locations, information-theoretic models of secret sharing (generating a common random key at two terminals, without letting an eavesdropper obtain information about this key) are considered.