Publication

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

Related publications (130)

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.

A feedback strategy for binary symmetric channels

Emre Telatar, Aslan Tchamkerten

Communication over unknown binary symmetric channels with instantaneous and perfect feedback is considered. We describe a universal scheme based on a decision feedback strategy. ...

2002

A feedback strategy for binary symmetric channels

Emre Telatar, Aslan Tchamkerten

Communication over unknown binary symmetric channels with instantaneous and perfect feedback is considered. We describe a universal scheme based on a decision feedback strategy. ...

2002

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

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

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

Design of efficient erasure codes with differential evolution

Mohammad Amin Shokrollahi

The design of practical and powerful codes for protection against erasures can be reduced to optimizing solutions of a highly nonlinear constraint satisfaction problem. In this paper we will attack this problem using the differential evolution approach and ...

2000

Symbol interleaved parallel concatenated trellis coded modulation

Christina Fragouli

This paper presents a method for efficient coding at high spectral efficiency using parallel concatenated trellis coded modulation (PCTCM) with symbol interleaving. The constituent encoders are optimized for symbol-wise free distance, and each has an infin ...

1999

Zero-error list capacities of discrete memoryless channels

Emre Telatar

We define zero-error list capacities for discrete memoryless channels. We find lower bounds to, and a characterization of these capacities. As is usual for such zero-error problems in information theory, the characterization is not generally a single-lette ...

1997

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