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.
In this paper, we address the design of any number of balanced multiple descriptions using the multiple description scalar quantization(MDSQ) technique. The proposed scheme has the advantages of low complexity, the possibility of being extended easily to a ...
We consider the impact of multi-user interference on a bit-interleaved coded-modulation system with M-ary PPM (BIC M-ary PPM) in an impulse-radio ultra-wideband physical layer. In a realistic scenario such as an ad hoc network, the interference is inherent ...
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 ...
e analyze a special class of configurations with h sources and N receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to \sq ...
On-chip interconnection networks for future systems on chip (SoC) will have to deal with the increasing sensitivity of global wires to noise sources such as crosstalk or power supply noise. Hence, transient delay and logic faults are likely to reduce the r ...
Institute of Electrical and Electronics Engineers2005
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 ...
The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is ...
Varaiya and Walrand found an elegant insight regarding the use of feedback in a causal coding context: While generally useful, feedback becomes useless when the channel is sufficiently symmetric. The goal of this note is to extend this insight to scenarios ...
Birkhauser Boston, C/O Springer-Verlag, Service Center, 44 Hartz Way, Secaucus, Nj 07096-2491 Usa2005
We consider communication through an infinite cascade of identical discrete memoryless channels. We allow the source and destination nodes to use coding schemes of arbitrary complexity, but restrict the intermediate (relay) nodes to process blocks of a fix ...
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 ...