Publication

Exploiting Common Randomness: a Resource for Network Secrecy

Related publications (36)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Capacity Achieving Codes from Randomness Conductors

Mahdi Cheraghchi Bashi Astaneh

We give a general framework for construction of small ensembles of capacity achieving linear codes for a wide range of (not necessarily memoryless) discrete symmetric channels, and in particular, the binary erasure and symmetric channels. The main tool use ...

2009

Using zero-rate feedback on binary additive channels with individual noise sequences

Michael Christoph Gastpar

Recently, Shayevitz and Feder introduced an individual sequence formulation of channel coding under model uncertainty and an elegant coding strategy that adapts Horstein's scheme to this setting to achieve the empirical capacity of the channel. Their schem ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Broadcast, relay and feedback in Gaussian channels

Sibi Raj Bhaskaran Pillai

Network information theory explores the fundamental data transport limits over communication networks. Broadcasting and relaying are two natural models arising in communication contexts where multiple users share a common communication medium. Number of re ...

EPFL2007

Delay and coding in multiple-user communications

Stéphane Musy

In multiple-user communications, the bursty nature of the packet arrival times cannot be divorced from the analysis of the transmission process. However, in traditional information theory the random arrival times are smoothed out by appropriated source cod ...

EPFL2007

Hierarchical Asynchronous Multiplexer for Readout Front-end ASIC for Multi-element Detectors in Medical Imaging

Rafal Tomasz Dlugosz

Multiplexers are one of the most important elements in readout front-end ASICs for multi-element detectors in medical imaging. In the paper a fully asynchronous multiplexer with limited hierarchical de-randomization mechanism has been presented. The hierar ...

2007

Broadcasting a message over erasure channels with cooperating receivers

Ramin Khalili

In this paper we consider the orthogonal cooperative broadcast channel with a common message. The downlink and cooperation channels are modelled by erasure channels and assumed to be orthogonal. We derive an achievable rate for this channel by using a comb ...

2006

Power, Spatio-Temporal Bandwidth, and Distortion in Large Sensor Networks

Martin Vetterli, Michael Christoph Gastpar

For a class of sensor networks, the task is to monitor an underlying physical phenomenon over space and time through an imperfect observation process. The sensors can communicate back to a central data collector over a noisy channel. The key pa- rameters i ...

Institute of Electrical and Electronics Engineers2005

An information theory for erasure channels (invited paper)

Ramin Khalili

In this paper we present a rapid review of known results in the context of different scenario of the erasure channel. We will also give a converse capacity bound for relay channel showing that the cut-set bound is not attainable in general by any fixed cod ...

2005

Feedback communication over unknown channels

Aslan Tchamkerten

Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, with perfect, causal output feedback for communication. Is there a coding scheme (possibly with variable transmission time) that can achieve the Burnashev erro ...

EPFL2005

Gaussian multiple-access channels under received-power constraints

Michael Christoph Gastpar

Performance limits for multiple-access channels are well known as long as the messages of different nodes are independent. Considerable research efforts have been devoted to the problem when the source information is dependent across nodes, revealing capac ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2004