The Experts below are selected from a list of 360 Experts worldwide ranked by ideXlab platform
Abbas El Gamal - One of the best experts on this subject based on the ideXlab platform.
-
strong functional representation lemma and applications to coding theorems
IEEE Transactions on Information Theory, 2018Co-Authors: Cheuk Ting Li, Abbas El GamalAbstract:This paper shows that for any random variables $X$ and $Y$ , it is possible to represent $Y$ as a function of $(X,Z)$ such that $Z$ is independent of $X$ and $I(X;Z|Y)\le \log (I(X;Y)+1)+4$ bits. We use this strong functional representation lemma (SFRL) to establish a bound on the rate needed for one-shot exact channel simulation for general (discrete or continuous) random variables, strengthening the results by Harsha et al. and Braverman and Garg, and to establish new and simple Achievability results for one-shot variable-length lossy source coding, multiple description coding, and Gray–Wyner system. We also show that the SFRL can be used to reduce the channel with state noncausally known at the encoder to a point-to-point channel, which provides a simple Achievability proof of the Gelfand–Pinsker theorem.
-
Strong Functional Representation Lemma and Applications to Coding Theorems
2018Co-Authors: Li, Cheuk Ting, Abbas El GamalAbstract:This paper shows that for any random variables $X$ and $Y$, it is possible to represent $Y$ as a function of $(X,Z)$ such that $Z$ is independent of $X$ and $I(X;Z|Y)\le\log(I(X;Y)+1)+4$ bits. We use this strong functional representation lemma (SFRL) to establish a bound on the rate needed for one-shot exact channel simulation for general (discrete or continuous) random variables, strengthening the results by Harsha et al. and Braverman and Garg, and to establish new and simple Achievability results for one-shot variable-length lossy source coding, multiple description coding and Gray-Wyner system. We also show that the SFRL can be used to reduce the channel with state noncausally known at the encoder to a point-to-point channel, which provides a simple Achievability proof of the Gelfand-Pinsker theorem.Comment: 15 pages, 1 figure, presented in part at the IEEE International Symposium on Information Theory, Aachen, Germany, June 201
-
an Achievability scheme for the compound channel with state noncausally available at the encoder
arXiv: Information Theory, 2010Co-Authors: Chandra Nair, Abbas El Gamal, Yeowkhiang ChiaAbstract:A new Achievability scheme for the compound channel with discrete memoryless (DM) state noncausally available at the encoder is established. Achievability is proved using superposition coding, Marton coding, joint typicality encoding, and indirect decoding. The scheme is shown to achieve strictly higher rate than the straightforward extension of the Gelfand-Pinsker coding scheme for a single DMC with DM state, and is optimal for some classes of channels.
-
3 receiver broadcast channels with common and confidential messages
arXiv: Information Theory, 2009Co-Authors: Yeowkhiang Chia, Abbas El GamalAbstract:This paper establishes inner bounds on the secrecy capacity regions for the general 3-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be sent to two receivers and kept secret from the third receiver. Achievability is established using indirect decoding, Wyner wiretap channel coding, and the new idea of generating secrecy from a publicly available superposition codebook. The inner bound is shown to be tight for a class of reversely degraded broadcast channels and when both legitimate receivers are less noisy than the third receiver. The second setup investigated in this paper is when the confidential message is to be sent to one receiver and kept secret from the other two receivers. Achievability in this case follows from Wyner wiretap channel coding and indirect decoding. This inner bound is also shown to be tight for several special cases.
Amin Gohari - One of the best experts on this subject based on the ideXlab platform.
-
quantum Achievability proof via collision relative entropy
IEEE Transactions on Information Theory, 2014Co-Authors: Salman Beigi, Amin GohariAbstract:In this paper, we provide a simple framework for deriving one-shot achievable bounds for some problems in quantum information theory. Our framework is based on the joint convexity of the exponential of the collision relative entropy and is a (partial) quantum generalization of the technique of Yassaee et al. from classical information theory. Based on this framework, we derive one-shot achievable bounds for the problems of communication over classical-quantum channels, quantum hypothesis testing, and classical data compression with quantum side information. We argue that our one-shot achievable bounds are strong enough to give the asymptotic achievable rates of these problems even up to the second order.
-
Achievability proof via output statistics of random binning
IEEE Transactions on Information Theory, 2014Co-Authors: Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin GohariAbstract:This paper introduces a new and ubiquitous framework for establishing Achievability results in network information theory problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. Furthermore, the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and strong secrecy problems, where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and eavesdropper’s observations in secrecy problems and closeness to a certain distribution (usually, i.i.d. distribution) in coordination problems. One important feature of the framework is to enable one to add an eavesdropper and obtain a result on the secrecy rates for free. We make a case for generality of the framework by studying examples in a variety of settings including channel coding, lossy source coding, joint source-channel coding, coordination, strong secrecy, feedback, and relaying. In particular, by investigating the framework for the lossy source coding problem over broadcast channel, it is shown that the new framework provides a simple alternative scheme to the hybrid coding scheme. In addition, new results on secrecy rate region (under strong secrecy criterion) of wiretap broadcast channel and wiretap relay channel are derived. In a set of accompanied papers, we have shown the usefulness of the framework to establish Achievability results for coordination problems, including interactive channel simulation, coordination via relay and channel simulation via another channel.
-
Achievability proof via output statistics of random binning
International Symposium on Information Theory, 2012Co-Authors: Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin GohariAbstract:This paper presents a new and ubiquitous framework for establishing Achievability results in network information theory (NIT) problems. The framework is used to prove various new results. To express the main tool, consider a set of discrete memoryless correlated sources (DMCS). Assume that each source (except one, Zn) is randomly binned at a finite rate. We find sufficient conditions on these rates such that the bin indices are nearly mutually independent of each other and of Zn. This is used in conjunction with the Slepian-Wolf (S-W) result to set up the framework. We begin by illustrating this method via examples from channel coding and rate-distortion (or covering problems). Next, we use the framework to prove a new result on the lossy transmission of a source over a broadcast channel. We also prove a new lower bound to a three receiver wiretap broadcast channel under a strong secrecy criterion. We observe that we can directly prove the strong notion of secrecy without resorting to the common techniques, e.g., the leftover hash lemma. We have also used our technique to solve the problem of two-node interactive channel simulation and the problem of coordination via a relay.
-
Achievability proof via output statistics of random binning
arXiv: Information Theory, 2012Co-Authors: Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin GohariAbstract:This paper introduces a new and ubiquitous framework for establishing Achievability results in \emph{network information theory} (NIT) problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. {Further,} the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and \emph{strong} secrecy problems where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and eavesdropper's observations in secrecy problems and closeness to a certain distribution (usually, i.i.d. distribution) in coordination problems. One important feature of the framework is to enable one {to} add an eavesdropper and obtain a result on the secrecy rates "for free." We make a case for generality of the framework by studying examples in the variety of settings containing channel coding, lossy source coding, joint source-channel coding, coordination, strong secrecy, feedback and relaying. In particular, by investigating the framework for the lossy source coding problem over broadcast channel, it is shown that the new framework provides a simple alternative scheme to \emph{hybrid} coding scheme. Also, new results on secrecy rate region (under strong secrecy criterion) of wiretap broadcast channel and wiretap relay channel are derived. In a set of accompanied papers, we have shown the usefulness of the framework to establish Achievability results for coordination problems including interactive channel simulation, coordination via relay and channel simulation via another channel.
Mohammad Hossein Yassaee - One of the best experts on this subject based on the ideXlab platform.
-
one shot Achievability via fidelity
International Symposium on Information Theory, 2015Co-Authors: Mohammad Hossein YassaeeAbstract:This paper provides a universal framework for establishing one-shot Achievability results for coordination and secrecy problems. The framework is built on our previous framework [Yassaee et al. 13] for proving one-shot Achievability results in the context of source and channel coding problems. In the coordination and secrecy problems, one needs to compare an induced distribution by encoding/decoding with an ideal distribution (satisfying some desirable properties) using a suitable criterion. In this paper, we use fidelity as a criterion for measuring the closeness of induced distribution with the ideal distribution. The framework exploits the stochastic mutual information coders at the encoders and decoders and uses Jensen's inequality to find a lower bound on the expected fidelity. Moreover, the framework employs Cauchy-Schwarz inequality to simplify the relations prior to applying Jensen's inequality. We illustrate the framework via channel synthesis problem and wiretap channel. Furthermore, a novel one-shot generalization of multivariate covering lemma and soft covering lemma (cf. Cuff'13) is established.
-
Achievability proof via output statistics of random binning
IEEE Transactions on Information Theory, 2014Co-Authors: Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin GohariAbstract:This paper introduces a new and ubiquitous framework for establishing Achievability results in network information theory problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. Furthermore, the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and strong secrecy problems, where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and eavesdropper’s observations in secrecy problems and closeness to a certain distribution (usually, i.i.d. distribution) in coordination problems. One important feature of the framework is to enable one to add an eavesdropper and obtain a result on the secrecy rates for free. We make a case for generality of the framework by studying examples in a variety of settings including channel coding, lossy source coding, joint source-channel coding, coordination, strong secrecy, feedback, and relaying. In particular, by investigating the framework for the lossy source coding problem over broadcast channel, it is shown that the new framework provides a simple alternative scheme to the hybrid coding scheme. In addition, new results on secrecy rate region (under strong secrecy criterion) of wiretap broadcast channel and wiretap relay channel are derived. In a set of accompanied papers, we have shown the usefulness of the framework to establish Achievability results for coordination problems, including interactive channel simulation, coordination via relay and channel simulation via another channel.
-
Achievability proof via output statistics of random binning
International Symposium on Information Theory, 2012Co-Authors: Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin GohariAbstract:This paper presents a new and ubiquitous framework for establishing Achievability results in network information theory (NIT) problems. The framework is used to prove various new results. To express the main tool, consider a set of discrete memoryless correlated sources (DMCS). Assume that each source (except one, Zn) is randomly binned at a finite rate. We find sufficient conditions on these rates such that the bin indices are nearly mutually independent of each other and of Zn. This is used in conjunction with the Slepian-Wolf (S-W) result to set up the framework. We begin by illustrating this method via examples from channel coding and rate-distortion (or covering problems). Next, we use the framework to prove a new result on the lossy transmission of a source over a broadcast channel. We also prove a new lower bound to a three receiver wiretap broadcast channel under a strong secrecy criterion. We observe that we can directly prove the strong notion of secrecy without resorting to the common techniques, e.g., the leftover hash lemma. We have also used our technique to solve the problem of two-node interactive channel simulation and the problem of coordination via a relay.
-
Achievability proof via output statistics of random binning
arXiv: Information Theory, 2012Co-Authors: Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin GohariAbstract:This paper introduces a new and ubiquitous framework for establishing Achievability results in \emph{network information theory} (NIT) problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. {Further,} the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and \emph{strong} secrecy problems where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and eavesdropper's observations in secrecy problems and closeness to a certain distribution (usually, i.i.d. distribution) in coordination problems. One important feature of the framework is to enable one {to} add an eavesdropper and obtain a result on the secrecy rates "for free." We make a case for generality of the framework by studying examples in the variety of settings containing channel coding, lossy source coding, joint source-channel coding, coordination, strong secrecy, feedback and relaying. In particular, by investigating the framework for the lossy source coding problem over broadcast channel, it is shown that the new framework provides a simple alternative scheme to \emph{hybrid} coding scheme. Also, new results on secrecy rate region (under strong secrecy criterion) of wiretap broadcast channel and wiretap relay channel are derived. In a set of accompanied papers, we have shown the usefulness of the framework to establish Achievability results for coordination problems including interactive channel simulation, coordination via relay and channel simulation via another channel.
Mahesh K Varanasi - One of the best experts on this subject based on the ideXlab platform.
-
rate splitting superposition coding and binning for groupcasting over the broadcast channel a general framework
arXiv: Information Theory, 2020Co-Authors: Henry P Romero, Mahesh K VaranasiAbstract:A general inner bound is given for the discrete memoryless broadcast channel with an arbitrary number of users and general message sets, a setting that accounts for the most general form of concurrent groupcasting, with messages intended for any set of subsets of receivers. Achievability is based on superposition coding and rate-splitting without and with binning, where each receiver jointly decodes both its desired messages as well as the partial interference assigned to it via rate-splitting. The proof of Achievability builds on the techniques for the description and analysis of superposition coding recently developed by the authors for the multiple-access channel with general messages as well as a new recursive mutual covering lemma for the analysis of the more general achievable scheme with binning.
-
rate splitting and superposition coding for concurrent groupcasting over the broadcast channel a general framework
International Symposium on Information Theory, 2017Co-Authors: Henry P Romero, Mahesh K VaranasiAbstract:A general inner bound is given for the discrete memoryless broadcast channel with an arbitrary number of users and general message sets, a setting that accounts for the most general form of concurrent groupcasting, with up to exponentially many messages intended for any set of subsets of receivers. Achievability is based on superposition coding and rate-splitting, where each receiver jointly decodes both its desired messages as well as the partial interference assigned to it via rate-splitting. The proof of Achievability builds on the techniques for the description and analysis of superposition coding recently developed by the authors for the multiple access channel with general messages.
Vincent Y F Tan - One of the best experts on this subject based on the ideXlab platform.
-
nonasymptotic and second order Achievability bounds for coding with side information
IEEE Transactions on Information Theory, 2015Co-Authors: Shun Watanabe, Shigeaki Kuzuoka, Vincent Y F TanAbstract:We present a novel nonasymptotic or finite blocklength Achievability bounds for three side-information problems in network information theory. These include: 1) the Wyner-Ahlswede-Korner (WAK) problem of almost-lossless source coding with rate-limited side-information; 2) the Wyner–Ziv (WZ) problem of lossy source coding with side-information at the decoder; and 3) the Gel’fand–Pinsker (GP) problem of channel coding with noncausal state information available at the encoder. The bounds are proved using ideas from channel simulation and channel resolvability. Our bounds for all three problems improve on all previous nonasymptotic bounds on the error probability of the WAK, WZ, and GP problems—in particular those derived by Verdu. Using our novel nonasymptotic bounds, we recover the general formulas for the optimal rates of these side-information problems. Finally, we also present achievable second-order coding rates by applying the multidimensional Berry–Esseen theorem to our new nonasymptotic bounds. Numerical results show that the second-order coding rates obtained using our nonasymptotic Achievability bounds are superior to those obtained using existing finite blocklength bounds.
-
non asymptotic and second order Achievability bounds for coding with side information
arXiv: Information Theory, 2013Co-Authors: Shun Watanabe, Shigeaki Kuzuoka, Vincent Y F TanAbstract:We present novel non-asymptotic or finite blocklength Achievability bounds for three side-information problems in network information theory. These include (i) the Wyner-Ahlswede-Korner (WAK) problem of almost-lossless source coding with rate-limited side-information, (ii) the Wyner-Ziv (WZ) problem of lossy source coding with side-information at the decoder and (iii) the Gel'fand-Pinsker (GP) problem of channel coding with noncausal state information available at the encoder. The bounds are proved using ideas from channel simulation and channel resolvability. Our bounds for all three problems improve on all previous non-asymptotic bounds on the error probability of the WAK, WZ and GP problems--in particular those derived by Verdu. Using our novel non-asymptotic bounds, we recover the general formulas for the optimal rates of these side-information problems. Finally, we also present achievable second-order coding rates by applying the multidimensional Berry-Esseen theorem to our new non-asymptotic bounds. Numerical results show that the second-order coding rates obtained using our non-asymptotic Achievability bounds are superior to those obtained using existing finite blocklength bounds.
