most citedA Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels

2 citations · 3 across the 3 of their papers we have counts for

collaborators
Showing cs.ITShow all

6 papers · 1 filter

cs.IT20092 cited

The Compound Capacity of Polar Codes

S. Hamed Hassani, Satish Babu Korada, Ruediger Urbanke

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 sequenc…

cs.IT200912 cited

Polar Codes are Optimal for Lossy Source Coding

Satish Babu Korada, Rudiger Urbanke

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…

cs.IT200932 cited

Polar Codes: Characterization of Exponent, Bounds, and Constructions

Satish Babu Korada, Eren Sasoglu, Rudiger Urbanke

Polar codes were recently introduced by Arıkan. They achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels under a low complexity successive cancell…

cs.IT20082 cited

A Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels

Satish Babu Korada, Eren Sasoglu

A generalization of Arıkan's polar code construction using transformations of the form where is an matrix is considered. Necessary and suffic…

cs.IT20081 cited

Tight Bounds on the Capacity of Binary Input random CDMA Systems

Satish Babu Korada, Nicolas Macris

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 distribution…

cs.IT2008

Exchange of Limits: Why Iterative Decoding Works

Satish Babu Korada, Ruediger Urbanke

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) p…