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.

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

Martin Vetterli, Michael Christoph Gastpar, Bixio Rimoldi

When is uncoded transmission optimal? This paper derives easy-to-check necessary and sufficient conditions that do not require finding the rate-distortion and the capacity-cost functions. We consider the symbol-by-symbol communication of discrete-time memo ...

2001

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

The displacement method in coding theory

Mohammad Amin Shokrollahi

Algebraic coding theory is one of the areas that routinely gives rise to computational problems involving various structured matrices, such as Hankel, Vandermonde, Cauchy matrices, and certain generalizations thereof. Their structure has often been used to ...

2001

On the capacity of multi-antenna Gaussian channels

Emre Telatar

We investigate the use of multi-antennas at both ends of a point-to-point communication system over the additive Gaussian channel. We consider a system with t transmit antennas and r receive antennas in which the received vector v∈Cτ depends on the transmi ...

2001

A Compact Non-Quasi-Static Extension of a Charge-Based MOS Model

Christian Enz, Jean-Michel Sallese

This paper presents a new and simple compact model for the intrinsic metal oxide semiconductor (MOS) transistor, which accurately takes into account the non quasistatic (NQS) effects. This is done without any additional assumption or simplification than th ...

2001

Design of capacity-approaching irregular low-density parity-check codes

Rüdiger Urbanke, Mohammad Amin Shokrollahi

We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the c ...

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

On optimal low-complexity source/channel coding

Martin Vetterli, Michael Christoph Gastpar, Bixio Rimoldi

Shannon's separation theorem gives a conceptually and practically appealing way to construct an optimal communication system in two independent steps, namely source compression and channel coding. However, sometimes it is worth considering {\em joint} sour ...

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

Capacity-achieving sequences

Mohammad Amin Shokrollahi

A capacity-achieving sequence of degree distributions for the erasure channel is, roughly speaking, a sequence of degree distributions such that graphs sampled uniformly at random satisfying those degree constraints lead to codes that perform arbitrarily c ...

2000