Publication

Status update through M/G/1/1 queues with HARQ

Related publications (32)

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.

Universal bounds on the scaling behavior of polar codes

Rüdiger Urbanke, Seyed Hamed Hassani, Ali Goli

We consider the problem of determining the tradeoff between the rate and the block-length of polar codes for a given block error probability when we use the successive cancellation decoder. We take the sum of the Bhattacharyya parameters as a proxy for the ...

2012

Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC

Rüdiger Urbanke, Shrinivas Kudekar

Convolutional low-density parity-check (LDPC) ensembles, introduced by Felstrom and Zigangirov, have excellent thresholds and these thresholds are rapidly increasing functions of the average degree. Several variations on the basic theme have been proposed ...

2011

On the scaling of polar codes: II. The behavior of un-polarized channels

Rüdiger Urbanke, Seyed Hamed Hassani

We provide upper and lower bounds on the escape rate of the Bhattacharyya process corresponding to polar codes where transmission takes place over the the binary erasure channel. More precisely, we bound the exponent of the number of sub-channels whose Bha ...

IEEE2010

Linear Universal Decoder for Compound Discrete Memoryless Channels

Rethnakaran Pulikkoonattu

Shannon in his seminal work \cite{paper:shannon} formalized the framework on the problem of digital communication of information and storage. He quantified the fundamental limits of compression and transmission rates. The quantity \textit{channel capacity} ...

2009

Channel Coding for Progressive Images in a 2-D Time-Frequency OFDM Block With Channel Estimation Errors

Laura Toni

Coding and diversity are very effective techniques for improving transmission reliability in a mobile wireless environ- ment. The use of diversity is particularly important for multimedia communications over fading channels. In this work, we study the tran ...

Institute of Electrical and Electronics Engineers2009

The invention of Fountain codes is a major advance in the field of error correcting codes. The goal of this work is to study and develop algorithms for source and channel coding using a family of Fountain codes known as Raptor codes. From an asymptotic poi ...

EPFL2009

Concentration of Magnetization for Linear Block Codes

Nicolas Macris, Satish Babu Korada, Shrinivas Kudekar

We consider communication over the binary erasure and the binary additive white gaussian noise channels using fixed linear block codes and also appropriate ensembles of such codes. We show concentration of the magnetization over the channel realizations an ...

2008

In this paper we consider the finite-length performance of Repeat-Accumulate codes in the waterfall region assuming the transmission on the binary erasure channel. We extend the finite-length scaling law of LDPC codes [1] to this ensemble and we derive the ...

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

Fountain Capacity

Emre Telatar

Fountain codes are currently employed for reliable and efficient transmission of information via erasure channels with unknown erasure rates. This correspondence introduces the notion of fountain capacity for arbitrary channels. In contrast to the conventi ...

2007

, ,

We consider communication over a binary erasure channel with low density parity check codes and optimal maximum a posteriori decoding. It is known that the problem of computing the average conditional entropy, over such code ensembles, in the asymptotic li ...

2007