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.
Shannon, in his seminal work, formalized the transmission of data over a communication channel and determined its fundamental limits. He characterized the relation between communication rate and error probability and showed that as long as the communicatio ...
We study the extremality of the binary erasure channel and the binary symmetric channel for Gallager's reliability function E-0 of binary input discrete memoryless channels evaluated under the uniform input distribution from the aspect of channel polarizat ...
Institute of Electrical and Electronics Engineers2014
In point-to-point source-channel communication with a fidelity criterion and a transmission cost constraint, the region of achievable cost and fidelity pairs is completely characterized by Shannon's separation theorem. However, this is in general only true ...
This paper explores the problem of feedback coding for a channel whose output is simultaneously used for two purposes: it is decoded to establish reliable communication, and it is used to control a dynamical system. In general, there is a tradeoff between ...
Institute of Electrical and Electronics Engineers2013
We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate l ...
In this paper, we propose a novel coding for long range Brillouin Optical Time Analysis (BOTDA) distributed sensors based on a combination of time and frequency pulses, resulting in an additional coding gain of √2 with respect to traditional intensit ...
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 ...
We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate l ...
Polar codes provably achieve the capacity of a wide array of channels under successive decoding. This assumes infinite precision arithmetic. Given the successive nature of the decoding algorithm, one might worry about the sensitivity of the performance to ...
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 ...
