Publication

Variable length coding over an unknown channel

Related publications (70)

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.

Digital Libraries

Thuy Le Nguyen

Digital libraries are libraries in which collections are stored in a digital format (the metadata at least). Digital libraries are now being made publicly available. However, building good user interfaces to query heterogeneous libraries requires to have a ...

2007

On the use of training sequences for channel estimation

Emre Telatar, 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. We study a scenario where communication is carried by first testing the channel by means of a training ...

2006

SVM-based Transfer of Visual Knowledge Across Robotic Platforms

Barbara Caputo, Jie Luo

This paper presents an SVM--based algorithm for the transfer of knowledge across robot platforms aiming to perform the same task. Our method exploits efficiently the transferred knowledge while updating incrementally the internal representation as new inf ...

IDIAP2006

Mechanical control of fluids in micro-analytical devices

Hubert Girault, Joël Rossier, Xiaoxia Bai

An apparatus for manipulating fluid samples comprises a micro-chip device having first and second covered channels, each channel having openings at both ends. The channels intersect to form a common intersection. Three of the openings of the channels are c ...

2006

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

International perspectives on engaging the public in neuroethics

Pierre Magistretti

With an ever-increasing understanding of the brain mechanisms associated with core human attributes and values, there is an increasing public interest in the results of neuroscience research and the ways in which that new knowledge will be used. Here, we p ...

2005

On the universality of Burnashev's error exponent

Emre Telatar, Aslan Tchamkerten

We consider communication over a time invariant discrete memoryless channel with noiseless and instantaneous feedback. We assume that the communicating parties are not aware of the underlying channel, however they know that it belongs to some specific fami ...

2005

On the use of training sequences for channel estimation

Emre Telatar, Aslan Tchamkerten

Suppose Q is a family of discrete memoryless channels. An unknown member of Q is available with perfect (causal) feedback for communication. A recent result (A. Tchamkerten and I.E. Telatar) shows the existence, for certain families of channels (e.g. binar ...

2005

Optimal feedback schemes over unknown channels

Emre Telatar

Communication over unknown discrete memoryless channels with instantaneous and perfect feedback is considered. For a given set of channels we define a notion of optimal coding schemes in terms of achievable rate and error exponent, and prove the existence ...

2004

Optimal feedback schemes over unknown channels

Emre Telatar, Aslan Tchamkerten

2004