Publications related to Universal bounds on the scaling behavior of polar codes

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 for Q-ary Source Coding

Emre Telatar, Mohammad Karzand

Polar coding is a recent channel coding technique invented by Arikan to achieve the 'symmetric capacity' of binary-input memoryless channels. Subsequently it was observed by Korada and Urbanke that such codes are also good for lossy channel coding, achievi ...

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

Polar coding: a brief tour

Emre Telatar

Arikan's 'polar coding' is a technique to achieve the symmetric capacity of binary input memoryless channels. In this talk I will attempt to describe this technique, and briefly discuss its extensions to q-ary input channels, multiple access channels and r ...

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

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

The compound capacity of polar codes

Rüdiger Urbanke, Seyed Hamed Hassani, Satish Babu Korada

We consider the compound capacity of polar codes under successive cancellation decoding for a collection of binary-input memoryless output-symmetric channels. By deriving a sequence of upper and lower bounds, we show that in general the compound capacity u ...

IEEE2009

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

Finite-length scaling of repeat-accumulate codes on the BEC

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

On capacity of line networks

Christina Fragouli, Daniela Tuninetti, Urs Niesen

We consider communication through a cascade of discrete memoryless channels (DMCs). The source and destination node of this cascade are allowed to use coding schemes of arbi- trary complexity, but the intermediate relay nodes are restricted to process only ...

Institute of Electrical and Electronics Engineers2007

Directly lower bounding the information capacity for channels with IID deletions and duplications

We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information capacity using ideas from renewal theory, rather than focusing on the transmis ...

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

Universal bounds on the scaling behavior of polar codes

Graph Chatbot

Chat with Graph Search

Polar Codes for Q-ary Source Coding

Polar coding: a brief tour

Linear Universal Decoder for Compound Discrete Memoryless Channels

Capacity Achieving Codes from Randomness Conductors

Performance of Polar Codes for Channel and Source Coding

The compound capacity of polar codes

Concentration of Magnetization for Linear Block Codes

Finite-length scaling of repeat-accumulate codes on the BEC

On capacity of line networks

Directly lower bounding the information capacity for channels with IID deletions and duplications

Polar Codes for Q-ary Source Coding

The compound capacity of polar codes

Polar coding: a brief tour

Concentration of Magnetization for Linear Block Codes

Finite-length scaling of repeat-accumulate codes on the BEC

Linear Universal Decoder for Compound Discrete Memoryless Channels

Directly lower bounding the information capacity for channels with IID deletions and duplications

Performance of Polar Codes for Channel and Source Coding

Capacity Achieving Codes from Randomness Conductors

On capacity of line networks