Home

Person

Michael Christoph Gastpar

About
Privacy
Disclaimer

Graph Chatbot

Related publications (132)

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

Information Theoretic Caching: The Multi-User Case

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

In this paper, we present information theoretic inner and outer bounds on the fundamental tradeoff between cache memory size and update rate in a multi-user cache network. Each user is assumed to have individual caches, while upon users’ requests, an updat ...

Ieee2016

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

K Users Caching Two Files: An Improved Achievable Rate

Michael Christoph Gastpar, Saeid Sahraei

Caching is an approach to smoothen the variability of traffic over time. Recently it has been proved that the local memories at the users can be exploited for reducing the peak traffic in a much more efficient way than previously believed. In this work we ...

Ieee2016

Multi-Library Coded Caching

Michael Christoph Gastpar, Saeid Sahraei

We study the problem of coded caching when the server has access to several libraries and each user makes independent requests from every library. The single-library scenario has been well studied and it has been proved that coded caching can significantly ...

2016

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

Locally differentially-private distribution estimation

Michael Christoph Gastpar, Adriano Pastore

We consider a setup in which confidential i.i.d. samples X1, ..., Xn from an unknown discrete distribution PX are passed through a discrete memoryless privatization channel (a.k.a. mechanism) which guarantees an epsilon-level of local differential privacy. ...

Ieee2016

Computation in Multicast Networks: Function Alignment and Converse Theorems

Michael Christoph Gastpar, Naveen Goela

The classical problem in a network coding theory considers communication over multicast networks. Multiple transmitters send independent messages to multiple receivers that decode the same set of messages. In this paper, computation over multicast networks ...

Institute of Electrical and Electronics Engineers2016

Efficient Algorithms for the Data Exchange Problem

Michael Christoph Gastpar, Sameer Pawar

In this paper, we study the data exchange problem, where a set of users is interested in gaining access to a common file, but where each has only partial knowledge about it as side-information. Assuming that the file is broken into packets, the side-inform ...

Institute of Electrical and Electronics Engineers2016

Information-Theoretic Caching

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

Motivated by the caching problem introduced by Maddah-Ali and Niesen, a problem of distributed source coding with side information is formulated, which captures a distinct interesting aspect of caching. For the single-user case, a single-letter characteriz ...

2015

Interactive Computation of Type-Threshold Functions in Collocated Gaussian Networks

Michael Christoph Gastpar, Chien-Yi Wang

In wireless sensor networks, various applications involve learning one or multiple functions of the measurements observed by sensors, rather than the measurements themselves. This paper focuses on the class of type-threshold functions, e.g., the maximum an ...

Institute of Electrical and Electronics Engineers2015

Secure transmission using an untrusted relay with scaled compute-and-forward

Michael Christoph Gastpar, Jasper Goseling

A two-hop channel is considered, in which the source wants to send information to the destination while keeping the information confidential from the relay. A novel lattice chain and compute-and-forward based scheme is proposed in which the destination pro ...

IEEE2015

A joint typicality approach to compute-forward

Michael Christoph Gastpar, Sung Hoon Lim, Chen Feng

A general framework for analyzing linear codes with joint typicality encoders and decoders is presented. Using this approach, we provide a new perspective on the compute-forward framework. In particular, an achievable rate region for computing the weighted ...

2015

Directed Information Flow and Causality in Neural Systems

Michael Christoph Gastpar

Springer New York2015

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

On lattice codes for Gaussian interference channels

Michael Christoph Gastpar, Jingge Zhu

The usefulness of lattice codes is investigated for two-user Gaussian interference channels (IC). A coding scheme based on the compute-and-forward technique is shown to achieve the capacity region of the Gaussian IC under strong interference. The proposed ...

2015

Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages

Michael Christoph Gastpar, Jingge Zhu

A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of codewords, our scheme im ...

Institute of Electrical and Electronics Engineers2015

Random Access With Physical-Layer Network Coding

Michael Christoph Gastpar, Jasper Goseling

We consider a physical-layer network coding strategy 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 transmission ...

Institute of Electrical and Electronics Engineers2015

Information Measures of Redundancy and Synergy in Neural Activity

Michael Christoph Gastpar

Springer New York2015

Approximate Ergodic Capacity of a Class of Fading Two-User Two-Hop Networks

Michael Christoph Gastpar, Chien-Yi Wang

The fading AWGN two-user two-hop network is considered where the channel coefficients are independent and identically distributed (i.i.d.) according to a continuous distribution and vary over time. For a broad class of channel distributions, the ergodic su ...

Institute of Electrical and Electronics Engineers2014

Page 5 of 7