Concept

Channel 4

Related publications (18)

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.

Broadcasting and Multicasting Nested Message Sets

Shirin Saeedi Bidokhti

Finding theoretical limits on the performance of communication systems and designing schemes to achieve them is one of the fundamental questions in information theory. While the theory of point-to-point communication is well-investigated, most problems hav ...

EPFL2012

Deterministic algorithm for the cooperative data exchange problem

Michael Christoph Gastpar, Sameer Pawar

Download Citation Email Print Request Permissions Save to Project In this paper we study the problem of data exchange, where each node in the system has a number of linear combinations of the data packets. Communicating over a public channel, the goal is f ...

IEEE2011

Broadcast Encryption and Traitor Tracing for Conditional Access Systems

Alexandre Karlov

In the context of the thesis we are studying the notions of broadcast encryption and traitor tracing in an industrial framework of conditional access systems related to Pay-TV. Broadcast encryption represents a cryptographic primitive which allows confiden ...

EPFL2011

The Role of Game Theory in Key Agreement Over a Public Channel

Michael Christoph Gastpar

In this work we study the problem of key agreement over a public noiseless channel when Alice, Bob and Charlie observe discrete memoryless sources of an unknown distribution. Alice and Bob want to agree on a key K-AB that is protected from Charlie. At the ...

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

Information-theoretic secrecy for wireless networks

Etienne Perron

The aim of information-theoretic secrecy is to ensure that an eavesdropper who listens to the wireless transmission of a message can only collect an arbitrarily small number of information bits about this message. In contrast to cryptography, there are no ...

EPFL2009

A tighter Cut-Set bound for the multi-terminal erasure channel without side information

Ramin Khalili

In this paper our recent results in the capacity of single relay erasure channels are used to derive a new and tighter cut-set bound. We initially present a simple and intuitive approach to derive the classical cut-set bound in General Multi-Terminal Erasu ...

2006

From EEG Dependency Multichannel Matching Pursuit to Sparse Topographic Decomposition

Ulrich Hoffmann

In this work we present a multichannel EEG decomposition model based on an adaptive topographic time-frequency approximation technique. It is an extension of the Matching Pur- suit algorithm and called Dependency Multichannel Matching Pursuit (DMMP). It ta ...

2006

Tidal networks 1. Automatic network extraction and preliminary scaling features from digital terrain maps

Andrea Rinaldo

We propose a method of automatic extraction of the tidal channel network from topographic data of marsh and tidal flat lands that uses a combination of a threshold elevation and threshold curvature. Not only the location but also the area of the channel be ...

1999