Publication

To Code, Or Not To Code: On the Optimality of Symbol-by-Symbol Communication

Publications associées (71)

Low-delay low-complexity error-correcting codes on sparse graphs

This dissertation presents a systematic exposition on finite-block-length coding theory and practice. We begin with the task of identifying the maximum achievable rates over noisy, finite-block-length constrained channels, referred to as (ε, n)-capacity Cε ...

EPFL2003

To code or not to code: lossy source-channel communication revisited

Martin Vetterli, Michael Christoph Gastpar, Bixio Rimoldi

What makes a source–channel communication system optimal? It is shown that in order to achieve an optimal cost–distortion tradeoff, the source and the channel have to be matched in a probabilistic sense. The match (or lack of it) involves the source distri ...

2003

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

Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel

Rüdiger Urbanke, Mohammad Amin Shokrollahi

We investigate the average erasure probability of the belief propagation algorithm over the binary erasure channel (BEC) for various finite-length low- density parity-check (LDPC) ensembles. In particular, we give tight upper bounds on the "error floor", i ...

2002

Optimal and suboptimal chaos receivers

Martin Hasler, Thomas Schimming

The paper describes the state of the art in the design of receivers for chaos based digital communication over noisy channels. In the first part, an information theoretic analysis of the potential of chaos in digital communication schemes is given, underli ...

2002

On source/channel codes of finite block length

Martin Vetterli, Michael Christoph Gastpar, Bixio Rimoldi

For certain fortunate choices of source/channel pairs, all sophisticated coding is in vain: for them, a code of block length one is sufficient to achieve optimal performance \cite{mgbrmvtrans}. Is the set of ``fortunate choices'' larger if we allow for cod ...

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

Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit

Emre Telatar

The mismatch capacity of a channel is the highest rate at which reliable communication is possible over the channel with a given (possibly suboptimal) decoding rule. This quantity has been studied extensively for single-letter decoding rules over discrete ...

2000

Time-Splitting Multiple-Access

Bixio Rimoldi

It is shown that the encoding/decoding problem for any asynchronous M-user memoryless multiple-access channel can be reduced to corresponding problems for at most 2M-1 single-user memoryless channels. This is done via a method called time-splitting multipl ...

1999

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

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