Publications by Satish Babu Korada

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 are Optimal for Lossy Source Coding

Rüdiger Urbanke, Satish Babu Korada

We consider lossy source compression of a binary symmetric source with Hamming distortion function. We show that polar codes combined with a low-complexity successive cancellation encoding algorithm achieve the rate-distortion bound. The complexity of both ...

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

A Class of Transformations that Polarize Binary-Input Memory less Channels

Satish Babu Korada, Eren Sasoglu

A generalization of Arikan's polar code construction using transformations of the form G(circle times n) where G is an l x l matrix is considered. Necessary and sufficient conditions are given for these transformations to ensure channel polarization. It is ...

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

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

Exchange of Limits: Why Iterative Decoding Works

Rüdiger Urbanke, Satish Babu Korada

We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes under MP decoding. The asymptotic (in the length) performance of such a combination for a fixed number of iterations is given by density e ...

2008

Broadcast and Slepian-Wolf multicast over Aref Networks

Satish Babu Korada, Dinkar Vasudevan

We consider source coding over Aref networks. In particular we consider the following two problems: (i) multicasting correlated sources to a set of receivers, (ii) broadcasting sources to their respective receivers. For the first problem we show necessary ...

2008

On Broadcast with a Common Message over Networks

Satish Babu Korada, Dinkar Vasudevan

We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable r ...

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

Spectrum of Exponentially Weighted Covariance Matrices

Olivier Lévêque, Satish Babu Korada

The spectrum of exponentially weighted covariance matrices is studied here. We first give a formal way of obtaining the spectrum using annealed approximation frequently used in Statistical Mechanics. Using the method developed by Bai and Silverstein we obt ...

2008

Satish Babu Korada

Graph Chatbot

Chat with Graph Search

Polar Codes are Optimal for Lossy Source Coding

The compound capacity of polar codes

A Class of Transformations that Polarize Binary-Input Memory less Channels

Robust Synchronization of Absolute and Difference Clocks over Networks

Exact Solution of the Gauge Symmetric p-Spin Glass Model on a Complete Graph

Concentration of Magnetization for Linear Block Codes

Exchange of Limits: Why Iterative Decoding Works

Broadcast and Slepian-Wolf multicast over Aref Networks

On Broadcast with a Common Message over Networks

Spectrum of Exponentially Weighted Covariance Matrices

Exchange of Limits: Why Iterative Decoding Works

On Broadcast with a Common Message over Networks

Polar Codes are Optimal for Lossy Source Coding

Spectrum of Exponentially Weighted Covariance Matrices

The compound capacity of polar codes

A Class of Transformations that Polarize Binary-Input Memory less Channels

Exact Solution of the Gauge Symmetric p-Spin Glass Model on a Complete Graph

Robust Synchronization of Absolute and Difference Clocks over Networks

Broadcast and Slepian-Wolf multicast over Aref Networks

Concentration of Magnetization for Linear Block Codes