Recherche

Afficher tous les résultats pour

Accueil

Personne

Michael Christoph Gastpar

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (131)

Page 3 sur 7

Total Correlation of Gaussian Vector Sources on the Gray–Wyner Network

Michael Christoph Gastpar, Guillaume Jean Op 't Veld

We study a generalization of Wyner’s Common Information to Watanabe’s Total Correlation. The first minimizes the description size required for a variable that can make two other random variables conditionally independent. If independence is unattainable, W ...

2016

Caching (a pair of) Gaussians

Michael Christoph Gastpar, Guillaume Jean Op 't Veld

A source produces i.i.d. vector samples from a Gaussian distribution, but the user is interested in only one component. In the cache phase, not knowing which component the user is interested in, a first compressed description is produced. Upon learning the ...

2015

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Michael Christoph Gastpar, Jasper Goseling

Compute-and-Forward (CF), also known as reliable physical layer network coding, is a technique that provides the possibility of exploiting the features of broadcast and superposition in wireless networks. It has been shown that the throughput for multiple ...

Institute of Electrical and Electronics Engineers2014

Approximate Ergodic Capacity of a Class of Fading 2-user 2-hop Networks

Michael Christoph Gastpar, Chien-Yi Wang

We consider a fading AWGN 2-user 2-hop network in which the channel coefficients are independently and identically distributed (i.i.d.) drawn from a continuous distribution and vary over time. For a broad class of channel distributions, we characterize the ...

Ieee2012

Information-Theoretic Caching: Sequential Coding for Computing

Michael Christoph Gastpar, Chien-Yi Wang, Sung Hoon Lim

Under the paradigm of caching, partial data are delivered before the actual requests of users are known. In this paper, this problem is modeled as a canonical distributed source coding problem with side information, where the side information represents th ...

Institute of Electrical and Electronics Engineers2016

Caching Gaussians: Minimizing Total Correlation on the Gray–Wyner Network

Michael Christoph Gastpar, Guillaume Jean Op 't Veld

We study a caching problem that resembles a lossy Gray–Wyner network: A source produces vector samples from a Gaussian distribution, but the user is interested in the samples of only one component. The encoder first sends a cache message without any knowle ...

Ieee2016

Caching of Bivariate Gaussians with Non-Uniform Preference Probabilities

Michael Christoph Gastpar, Guillaume Jean Op 't Veld

Caching is technique that alleviates networks during peak hours by transmitting partial information before a request for any is made. We study this method in a lossy source coding setting with Gaussian databases. A good caching strategy minimizes the data ...

2017

The Gaussian lossy Gray-Wyner network

Michael Christoph Gastpar, Erixhen Sula

We consider the problem of source coding subject to a fidelity criterion for the Gray-Wyner network that connects a single source with two receivers via a common channel and two private channels. The pareto-optimal trade-offs between the sum-rate of the pr ...

2020

Properties of the Strong Data Processing Constant for Rényi Divergence

Michael Christoph Gastpar

Strong data processing inequalities (SDPI) are an important object of study in Information Theory and have been well studied for f-divergences. Universal upper and lower bounds have been provided along with several applications, connecting them to impossib ...

Institute of Electrical and Electronics Engineers Inc.2024

The Price of Distributed: Rate Loss in the CEO Problem

Michael Christoph Gastpar, Alper Köse, Ahmet Arda Atalik

In the distributed remote (CEO) source coding problem, many separate encoders observe independently noisy copies of an underlying source. The rate loss is the difference between the rate required in this distributed setting and the rate that would be requi ...

2022

List-Decoding for the Arbitrarily Varying Channel Under State Constraints

Michael Christoph Gastpar

List-decoding for arbitrarily varying channels (AVCs) under state constraints is investigated. It is shown that rates within of the randomized coding capacity of AVCs with input-dependent state can be achieved under maximal error with list-decoding using l ...

2012

Information-Theoretic Caching: The Multi-User Case

Michael Christoph Gastpar, Chien-Yi Wang, Sung Hoon Lim

In this paper, we consider a cache aided network in which each user is assumed to have individual caches, while upon users’ requests, an update message is sent through a common link to all users. First, we formulate a general information theoretic setting ...

Institute of Electrical and Electronics Engineers2017

Function Identification in Neuron Populations via Information Bottleneck

Michael Christoph Gastpar

It is plausible to hypothesize that the spiking responses of certain neurons represent functions of the spiking signals of other neurons. A natural ensuing question concerns how to use experimental data to infer what kind of a function is being computed. M ...

MDPI AG2013

Quantifying high-order interdependencies via multivariate extensions of the mutual information

Michael Christoph Gastpar

This paper introduces a model-agnostic approach to study statistical synergy, a form of emergence in which patterns at large scales are not traceable from lower scales. Our framework leverages various multivariate extensions of Shannon's mutual information ...

2019

Successive Refinement to Caching for Dynamic Content

Michael Christoph Gastpar

To reduce the network load during peak hours, servers deliver partial data to users during the off-peak time of the network before the actual requests are known, which is known as caching. This paper studies a single user caching problem in which the file ...

IEEE2019

Physical-layer Network Coding on the Random-access Channel

Michael Christoph Gastpar, Jasper Goseling

We consider a physical-layer network coding strat- egy for the random-access channel, based on compute-and- forward. When packets collide, it is possible to reliably recover a linear combination of the packets at the receiver. Over many rounds of transmiss ...

2013

Sensing and communication with and without bits

Martin Vetterli, Michael Christoph Gastpar, Pier Luigi Dragotti

The successful design of sensor network architectures depends crucially on the structure of the sampling, observation, and communication processes. One of the most fundamental ques- tions concerns the sufficiency of discrete approximations in time, space, ...

2006

The Persuasion Bottleneck

Michael Christoph Gastpar

When a delivery agency persuades a bicycle courier worker to accept a certain job, it does so by revealing the right amount and kind of information. The goal is to reward both the agent as well as the worker accordingly. In this paper, we model the act of ...

Institute of Electrical and Electronics Engineers Inc.2024

Compute-forward multiple access (CFMA) with nested LDPC codes

Michael Christoph Gastpar, Adriano Pastore, Erixhen Sula, Sung Hoon Lim, Jingge Zhu

Inspired by the compute-and-forward scheme from Nazer and Gastpar, a novel multiple-access scheme introduced by Zhu and Gastpar makes use of nested lattice codes and sequential decoding of linear combinations of codewords to recover the individual messages ...

2017

Variational Characterizations of Sibson's α-Mutual Information

Michael Christoph Gastpar

Sibson's α-mutual information has received renewed attention recently in several contexts: concentration of measure under dependence, statistical learning, hypothesis testing, and estimation theory. In this work, we introduce several variational representa ...

Institute of Electrical and Electronics Engineers Inc.2024