Channel coding in the presence of side information
In this survey we review the concepts and methods of communication systems equipped
with side information. We focus on the channel coding problem, where side information is …
with side information. We focus on the channel coding problem, where side information is …
Statistical measurement of information leakage
Abstract Information theory provides a range of useful methods to analyse probability
distributions and these techniques have been successfully applied to measure information …
distributions and these techniques have been successfully applied to measure information …
Vector Gaussian CEO problem under logarithmic loss and applications
Y Uğur, IE Aguerri, A Zaidi - IEEE Transactions on Information …, 2020 - ieeexplore.ieee.org
In this paper, we study the vector Gaussian Chief Executive Officer (CEO) problem under
logarithmic loss distortion measure. Specifically, K≥ 2 agents observe independently …
logarithmic loss distortion measure. Specifically, K≥ 2 agents observe independently …
Information geometric formulation and interpretation of accelerated Blahut-Arimoto-type algorithms
We propose two related iterative algorithms for computing the capacity of discrete
memoryless channels. The celebrated Blahut-Arimoto algorithm is a special case of our …
memoryless channels. The celebrated Blahut-Arimoto algorithm is a special case of our …
On the loss of single-letter characterization: The dirty multiple access channel
T Philosof, R Zamir - IEEE Transactions on Information Theory, 2009 - ieeexplore.ieee.org
For general memoryless systems, the existing information-theoretic solutions have a
ldquosingle-letterrdquo form. This reflects the fact that optimum performance can be …
ldquosingle-letterrdquo form. This reflects the fact that optimum performance can be …
Algorithmic computability and approximability of capacity-achieving input distributions
The capacity of a channel can usually be characterized as a maximization of certain entropic
quantities. From a practical point of view it is of primary interest to not only compute the …
quantities. From a practical point of view it is of primary interest to not only compute the …
Vector Gaussian CEO problem under logarithmic loss
Y Ugur, IE Aguerri, A Zaidi - 2018 IEEE Information Theory …, 2018 - ieeexplore.ieee.org
In this paper, we study the vector Gaussian Chief Executive Officer (CEO) problem under
logarithmic loss distortion measure. Specifically, K> 2 agents observe independently …
logarithmic loss distortion measure. Specifically, K> 2 agents observe independently …
Iterative minimization algorithm on a mixture family
M Hayashi - Information Geometry, 2024 - Springer
Iterative minimization algorithms appear in various areas including machine learning, neural
networks, and information theory. The em algorithm is one of the famous iterative …
networks, and information theory. The em algorithm is one of the famous iterative …
What can AI Learn from Human Exploration? Intrinsically-Motivated Humans and Agents in Open-World Exploration
What drives exploration? Understanding intrinsic motivation is a long-standing question in
both cognitive science and artificial intelligence (AI); numerous exploration objectives have …
both cognitive science and artificial intelligence (AI); numerous exploration objectives have …
Extension of the Blahut–Arimoto algorithm for maximizing directed information
I Naiss, HH Permuter - IEEE Transactions on Information …, 2012 - ieeexplore.ieee.org
In this paper, we extend the Blahut-Arimoto algorithm for maximizing Massey's directed
information. The algorithm can be used for estimating the capacity of channels with delayed …
information. The algorithm can be used for estimating the capacity of channels with delayed …