Concept

Noisy-channel coding theorem

Related publications (317)

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.

Effect of Interfering Users on the Modulation Order and Code Rate for UWB Impulse-Radio Bit-Interleaved Coded M-ary PPM

Jean-Yves Le Boudec, Ruben Merz

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 ...

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

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

Fading observation alignment via feedback

Michael Christoph Gastpar

In some remote sensing applications, the functional relationship between the source being observed and the sensor readings may not be known. Because of communication constraints, this uncertainty may result in poor end-to-end distortion. If the sensors hav ...

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

Causal coding and feedback in Gaussian sensor networks

Michael Christoph Gastpar

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

On the Capacity of Large Gaussian Relay Networks

Martin Vetterli, Michael Christoph Gastpar

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 ...

2005

On the universality of Burnashev's error exponent

Emre Telatar, Aslan Tchamkerten

We consider communication over a time-invariant discrete memoryless channel (DMC) with noiseless and instantaneous feedback. We assume that the transmitter and the receiver are not aware of the underlying channel, however, they know that it belongs to some ...

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

On the Throughput Improvement due to Limited Complexity Processing at Relay Nodes

Christina Fragouli

We consider a source that transmits information to a receiver by routing it over a communication network represented by a graph and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that there exist config ...

2005

Error Control Schemes for On-chip Communication Links: the energy-reliability trade-off

Giovanni De Micheli, Luca Benini

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