Publication

Multiuser Random Coding Techniques for Mismatched Decoding

Related publications (70)

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.

Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q

Mohammad Amin Shokrollahi

Transmission of packets over computer networks is subject to packet-level errors, which appear as "bursts" of bit-level errors and are not well modeled by memoryless binary channels. A standard scrambling technique is used for transmission of packets by th ...

2004

Optimal feedback schemes over unknown channels

Emre Telatar

Communication over unknown discrete memoryless channels with instantaneous and perfect feedback is considered. For a given set of channels we define a notion of optimal coding schemes in terms of achievable rate and error exponent, and prove the existence ...

2004

Optimal feedback schemes over unknown channels

Emre Telatar, Aslan Tchamkerten

2004

MIMO space-time block coded receivers over frequency selective fading channels

Ali H. Sayed

We develop an adaptive receiver for multiple-input multiple-output (MIMO) frequency selective channels that employ space-time block-coded transmissions with cyclic prefixing. The receiver performs both interference suppression and equalization for multiuse ...

IEEE2004

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

Xiao-Yu Hu

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

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

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

Gaussian ISI channels and the generalized likelihood ratio test

Emre Telatar

Decoders employing the generalized likelihood ratio test can achieve rates that can be achieved by maximum likelihood decoders on ISI channels even though they are ignorant of the channel characteristics ...

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