Publication

The case for structured random codes in network communication theorems

Publications associées (68)

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

On Average Throughput Benefits and Alphabet Size in Network Coding

Christina Fragouli, Emina Soljanin

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

2005

Power-bandwidth-distortion scaling laws for sensor networks

Martin Vetterli, Michael Christoph Gastpar

The goal of a class of sensor networks is to monitor an underlying physical reality at the highest possible fidelity. Sensors acquire noisy measurements and have to communicate them over a power- and possibly bandwidth-constrained interference channel to a ...

2004

Potential of chaos communication over noisy channels - Channel coding using chaotic piecewise linear maps

Martin Hasler, Thomas Schimming

The paper gives an information theoretic analysis of the potential of chaos in digital communication schemes, underlining that there is no fundamental principle that speaks against the use of chaotic systems in digital communications. The channel model con ...

2002

To code or not to code

Michael Christoph Gastpar

It is well known and surprising that the uncoded transmission of an independent and identically distributed Gaussian source across an additive white Gaussian noise channel is optimal: No amount of sophistication in the coding strategy can ever perform bett ...

EPFL2002

Ergodic chaos shift keying for 2 users

Martin Hasler, Thomas Schimming

We show how a multiuser chaos-based communication system can be designed. The approach builds on the recently introduced method of ergodic chaos shift keying. This method uses a nonlinear correlation estimator for extracting the binary information from the ...

2001

To code or not to code

Martin Vetterli, Michael Christoph Gastpar, Bixio Rimoldi

The theory and practice of digital communication during the past 50 years has been strongly influenced by Shannon's separation theorem. While it is conceptually and practically appealing to separate source from channel coding, either step requires infinite ...

2000

A spectral criterion for feedback coding

Michael Christoph Gastpar

This work considers the Gaussian channel with noiseless feedback and an average block or symbol energy constraint. For first-order Markov noise, the optimal form of the output power spectrum for the average symbol energy constraint is derived. A simple cod ...

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

Multiresolution broadcast for digital HDTV using joint source-channel coding

Martin Vetterli

The use of multiresolution (MR) joint source-channel coding in the context of digital terrestrial broadcasting of high-definition television (HDTV) is shown to be an efficient alternative to single-resolution techniques, which suffer from a sharp threshold ...

1993