Publication

Linear Universal Decoder for Compound Discrete Memoryless Channels

Related publications (412)

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.

Polar codes: Characterization of exponent, bounds, and constructions

Rüdiger Urbanke, Satish Babu Korada, Eren Sasoglu

Polar codes were recently introduced by Arikan. They achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancellation decoding strategy. The original polar code construction is closely rel ...

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

A Simple Converse of Burnashev's Reliability Function

Bixio Rimoldi, Emre Telatar, Peter Allan Berlin

In a remarkable paper published in 1976, Burna- shev determined the reliability function of variable-length block codes over discrete memoryless channels (DMCs) with feedback. Subsequently, an alternative achievability proof was obtained by Yamamoto and It ...

2009

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

On Fidelity Per Unit Cost

Bixio Rimoldi, Marius Kleiner

We consider source coding with a ﬁdelity criterion, channel coding with a channel input constraint, and the combined problem of reproducing a source across a noisy channel. All three cases face a similar tradeoff between resource and performance, and the o ...

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

Decay of Correlations in Low Density Parity Check Codes: Low Noise Regime

Nicolas Macris, Shrinivas Kudekar

Consider transmission over a binary additive white gaussian noise channel using a fixed low-density parity check code. We consider the posterior measure over the code bits and the corresponding correlation between two codebits, averaged over the noise real ...

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

Decay of Correlations in Low Density Parity Check Codes: Low Noise Regime

Nicolas Macris, Shrinivas Kudekar

2009

Delay with network coding and feedback

Christina Fragouli, Lorenzo Keller

We consider the problem of minimizing delay when broadcasting over erasure channels with feedback. A sender wishes to communicate the same set of μ messages to several receivers over separate erasure channels. The sender can broad- cast a single message or ...

2009

CGU-frame-based representations and their connection with Reed-Solomon and DCT/DST coding schemes

We investigate the use of overcomplete frame representations to correct errors occurring over burst-based transmission channels or channels leading to isolated errors. We show that when the overcomplete signal representation is based on a class of frames, ...

2009

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