Concept

Typical set

Publications associées (9)

Towards an Algebraic Network Information Theory: Distributed Lossy Computation of Linear Functions

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

Consider the important special case of the K-user distributed source coding problem where the decoder only wishes to recover one or more linear combinations of the sources. The work of Körner and Marton demonstrated that, in some cases, the optimal rate re ...

2019

Coding for Communications and Secrecy

Mani Bastaniparizi

Shannon, in his landmark 1948 paper, developed a framework for characterizing the fundamental limits of information transmission. Among other results, he showed that reliable communication over a channel is possible at any rate below its capacity. In 2008, ...

EPFL2017

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

On Distributed Successive Refinement with Lossless Recovery

Michael Christoph Gastpar, Chien-Yi Wang

The problem of successive refinement in distributed source coding and in joint source-channel coding is considered. The emphasis is placed on the case where the sources have to be recovered losslessly in the second stage. In distributed source coding, it i ...

2014

Polar Coding Theorems for Discrete Systems

Eren Sasoglu

Polar coding is a recently invented technique for communication over binary-input memoryless channels. This technique allows one to transmit data at rates close to the symmetric-capacity of such channels with arbitrarily high reliability, using low-complex ...

EPFL2011

Statistical physics methods for sparse graph codes

Shrinivas Kudekar

This thesis deals with the asymptotic analysis of coding systems based on sparse graph codes. The goal of this work is to analyze the decoder performance when transmitting over a general binary-input memoryless symmetric-output (BMS) channel. We consider t ...

EPFL2009

Towards an Algebraic Network Information Theory: Distributed Lossy Computation of Linear Functions

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

2019

Coding for Communications and Secrecy

Mani Bastaniparizi

EPFL2017

A joint typicality approach to compute-forward

Michael Christoph Gastpar, Sung Hoon Lim, Chen Feng

2015

On Distributed Successive Refinement with Lossless Recovery

Michael Christoph Gastpar, Chien-Yi Wang

2014

Polar Coding Theorems for Discrete Systems

Eren Sasoglu

EPFL2011

Statistical physics methods for sparse graph codes

Shrinivas Kudekar

EPFL2009

Fountain Capacity

Emre Telatar

Fountain codes are currently employed for reliable and efficient transmission of information via erasure channels with unknown erasure rates. This correspondence introduces the notion of fountain capacity for arbitrary channels. In contrast to the conventi ...

2007

Power-Efficient Sensor Placement and Transmission Structure for Data Gathering under Distortion Constraints

Razvan Cristescu

We consider the joint optimization of sensor placement and transmission structure for data gathering, where a given number of nodes need to be placed in a field such that the sensed data can be reconstructed at a sink within specified distortion bounds whi ...

2006

Fountain Codes for the Slepian-Wolf Problem

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

In this paper, we describe one solution to the two-user Slepian-Wolf problem in a certain part of the achievable region using fountain codes. Symmetric case of memoryless compression of two correlated sources is considered and modeled by a BSC channel. The ...

2006