Publications related to Asymptotic equipartition property

A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs

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

Compute–forward is a coding technique that enables receiver(s) in a network to directly decode one or more linear combinations of the transmitted codewords. Initial efforts focused on Gaussian channels and derived achievable rate regions via nested lattice ...

2022

Near-Optimal Noisy Group Testing via Separate Decoding of Items

Volkan Cevher, Jonathan Mark Scarlett

In this paper, we revisit an efficient algorithm for noisy group testing in which each item is decoded separately (Malyutov and Mateev, 1980), and develop novel performance guarantees via an information-theoretic framework for general noise models. For the ...

IEEE2018

Near-Optimal Noisy Group Testing via Separate Decoding of Items

Volkan Cevher, Jonathan Mark Scarlett

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of tests, and is relevant in applications such as medical testing, communication protocols, pattern matching, and more. In this pa ...

2018

Polarization and Channel Ordering: Characterizations and Topological Structures

Rajai Nasser

Information theory is the field in which we study the fundamental limitations of communication. Shannon proved in 1948 that there exists a maximum rate, called capacity, at which we can reliably communicate information through a given channel. However, Sha ...

EPFL2017

Coding schemes for broadcast erasure channels with feedback: the two multicast case

Christina Fragouli, Efe Onaran

We consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each of them destined to a different group of

N

users) and regularly available instantaneous receiver ACK/NACK feedback. Using the insight gained from recent ...

2013

Statistical Inference for Partially Observed Stochastic Epidemics

Andrea Kraus

This work is concerned with the estimation of the spreading potential of the disease in the initial stages of an epidemic. A speedy and accurate estimation is important for determining whether or not interventions are necessary to prevent a major outbreak. ...

EPFL2013

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

The Kaspi Rate-Distortion Problem with Encoder Side-Information: Binary Erasure Case

Emre Telatar, Suhas Diggavi, Etienne Perron

We consider the problem of compressing a binary symmetric i.i.d. source stream for two decoders, one of which has access to side-information. Kaspi found the rate-distortion tradeoff for this problem for general discrete memoryless sources for the two case ...

2006

On the Role of Encoder Side-Information in Source Coding for Multiple Decoders

Emre Telatar, Suhas Diggavi, Etienne Perron

We consider a lossy source coding problem where the description of a source is going to be used by two decoders, each having access to information correlated with the source. This side-information is also present at the encoder. We give inner and outer bou ...

2006

On the universality of Burnashev's error exponent

Emre Telatar, Aslan Tchamkerten

We consider communication over a time-invariant discrete memoryless channel (DMC) with noiseless and instantaneous feedback. We assume that the transmitter and the receiver are not aware of the underlying channel, however, they know that it belongs to some ...

2005

Asymptotic equipartition property

Graph Chatbot

Chat with Graph Search

A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs

Near-Optimal Noisy Group Testing via Separate Decoding of Items

Near-Optimal Noisy Group Testing via Separate Decoding of Items

Polarization and Channel Ordering: Characterizations and Topological Structures

Coding schemes for broadcast erasure channels with feedback: the two multicast case

Statistical Inference for Partially Observed Stochastic Epidemics

Fountain Codes for the Slepian-Wolf Problem

The Kaspi Rate-Distortion Problem with Encoder Side-Information: Binary Erasure Case

On the Role of Encoder Side-Information in Source Coding for Multiple Decoders

On the universality of Burnashev's error exponent

A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs

Polarization and Channel Ordering: Characterizations and Topological Structures

Coding schemes for broadcast erasure channels with feedback: the two multicast case

Statistical Inference for Partially Observed Stochastic Epidemics

Fountain Codes for the Slepian-Wolf Problem

The Kaspi Rate-Distortion Problem with Encoder Side-Information: Binary Erasure Case

On the Role of Encoder Side-Information in Source Coding for Multiple Decoders

On the universality of Burnashev's error exponent

Near-Optimal Noisy Group Testing via Separate Decoding of Items

Near-Optimal Noisy Group Testing via Separate Decoding of Items