Publications de Satish Babu Korada

Exchange of Limits: Why Iterative Decoding Works

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

2011

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 capacity of arbitrary symmetric binary-input discrete memoryless channels under a low complexity successive cancellation decoding strategy. The original polar code construction is closely rel ...

2010

Tight Bounds on the Capacity of Binary Input random CDMA Systems

Nicolas Macris, Satish Babu Korada

We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number of users, we pr ...

2010

Polar Codes are Optimal for Lossy Source Coding

Rüdiger Urbanke, Satish Babu Korada

We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar codes achieve the capacity of arbitrary symmetric binary-input discrete mem ...

Institute of Electrical and Electronics Engineers2010

An empirical scaling law for polar codes

Rüdiger Urbanke, Emre Telatar, Satish Babu Korada, Andrea Montanari

IEEE2010

Polar codes for Slepian-Wolf, Wyner-Ziv, and Gelfand-Pinsker

Rüdiger Urbanke, Satish Babu Korada

2010

Polar codes for channel and source coding

Satish Babu Korada

The two central topics of information theory are the compression and the transmission of data. Shannon, in his seminal work, formalized both these problems and determined their fundamental limits. Since then the main goal of coding theory has been to find ...

EPFL2009

Polar Codes: Characterization of Exponent, Bounds, and Constructions

Rüdiger Urbanke, Satish Babu Korada, Eren Sasoglu

Polarization codes were recently introduced by Ar\i kan. They are explicit code constructions which achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels (and even extensions thereof) under a low complexity successive decodi ...

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

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

Nicolas Macris, Satish Babu Korada

We consider a gauge symmetric version of the p-spin glass model on a complete graph. The gauge symmetry guarantees the absence of replica symmetry breaking and allows to fully use the interpolation scheme of Guerra to rigorously compute the free energy. In ...

2009

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