Concept

Capacité d'un canal

Publications associées (454)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Capacity Achieving Codes from Randomness Conductors

Mahdi Cheraghchi Bashi Astaneh

We give a general framework for construction of small ensembles of capacity achieving linear codes for a wide range of (not necessarily memoryless) discrete symmetric channels, and in particular, the binary erasure and symmetric channels. The main tool use ...

2009

Channel Coding for Progressive Images in a 2-D Time-Frequency OFDM Block With Channel Estimation Errors

Laura Toni

Coding and diversity are very effective techniques for improving transmission reliability in a mobile wireless environ- ment. The use of diversity is particularly important for multimedia communications over fading channels. In this work, we study the tran ...

Institute of Electrical and Electronics Engineers2009

Differential Distributed Cayley Space-Time Codes

Frédérique Oggier

We consider a wireless relay network with no channel information, which implements differential distributed space-time coding. We propose a coding strategy based on Cayley codes, which yields high data rate codes available for an arbitrary number of relay ...

2009

Performance of Polar Codes for Channel and Source Coding

Rüdiger Urbanke, Satish Babu Korada, Nadine Hussami

Polar codes, introduced recently by Arikan, are the first family of codes known to achieve capacity of symmetric channels using a low complexity successive cancellation decoder. Although these codes, combined with successive cancellation, are optimal in th ...

2009

Ergodic Interference Alignment

Michael Christoph Gastpar

Consider a K-user interference channel with time-varying fading. At any particular time, each receiver will see a signal from most transmitters. The standard approach to such a scenario results in each transmitter-receiver pair achieving a rate proportiona ...

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

On the Capacity of Non-Coherent Network Coding

Mahdi Jafari, Christina Fragouli, Suhas Diggavi

The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the common min-cut value towards N >= 1 receivers can also be achieved using pack ...

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

Polar Codes are Optimal for Lossy Source Coding

Rüdiger Urbanke, Satish Babu Korada

We consider lossy source compression of a binary symmetric source with Hamming distortion function. We show that polar codes combined with a low-complexity successive cancellation encoding algorithm achieve the rate-distortion bound. The complexity of both ...

2009

Bounds on the Sum Capacity of Synchronous Binary CDMA Channels

Pedram Pad, Vahid Aref

In this paper, we obtain a family of lower bounds for the sum capacity of code-division multiple-access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The envelope of this ...

Institute of Electrical and Electronics Engineers2009

Some observations on limited feedback for multiaccess channels

Michael Christoph Gastpar

Most information-theoretic analyses of communication systems with feedback assume perfect output feedback. For multiaccess channels, this feedback can enable cooperation between users. However, as shown by a simple example, the rate required by the feedbac ...

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

On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels

Bixio Rimoldi, Ninoslav Marina

The asynchronous capacity region of memoryless multiple-access channels is the union of certain polytopes. It is well-known that vertices of such polytopes may be ap- proached via a technique called successive decoding. It is also known that an extension o ...

2009