E. Telatar

Publications
Influence

Capacity of Multi-antenna Gaussian Channels

E. Telatar
Computer Science
Eur. Trans. Telecommun.
1 November 1999

We investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading. Expand

12,344
943
PDF

Finite-length analysis of low-density parity-check codes on the binary erasure channel

Changyan Di, David Proietti, E. Telatar, T. Richardson, R. Urbanke
Mathematics, Computer Science
IEEE Trans. Inf. Theory
1 June 2002

Note: 39th Allerton Conf. on Communication, Control, and Computing Reference LTHC-CONF-2001-002 Record created on 2006-11-22, modified on 2017-05-12

On the rate of channel polarization

E. Arıkan, E. Telatar
Physics, Computer Science
IEEE International Symposium on Information…
24 July 2008

A bound is given on the rate of channel polarization. Expand

Capacity and mutual information of wideband multipath fading channels

E. Telatar, D. Tse
Computer Science
IEEE Trans. Inf. Theory
16 August 1998

We investigate the capacity and mutual information of a broadband fading channel consisting of a finite number of time-varying paths. Expand

Polarization for arbitrary discrete memoryless channels

Eren Sasoglu, E. Telatar, E. Arıkan
Mathematics, Computer Science
IEEE Information Theory Workshop
3 August 2009

Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary discrete memoryless channels. Expand

Bounds on the capacity region of a class of interference channels

E. Telatar, D. Tse
Mathematics, Computer Science
IEEE International Symposium on Information…
24 June 2007

We prove a new outer bound to the capacity region of a certain class of interference channels, and quantify the gap between it and the Han-Kobayashi inner bound. Expand

Combining Queueing Theory with Information Theory for Multiaccess

E. Telatar, R. Gallager
Computer Science
IEEE J. Sel. Areas Commun.
1 August 1995

We develop and analyze a multiaccess communication model over the additive Gaussian noise channel that incorporates some queueing-theoretic aspects. Expand

Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit

A. Ganti, A. Lapidoth, E. Telatar
Mathematics, Computer Science
IEEE Trans. Inf. Theory
1 November 2000

The mismatch capacity of a channel is the highest rate at which reliable communication is possible over the channel with a given (possibly suboptimal) decoding rule. Expand

Polar Codes for the Two-User Multiple-Access Channel

Eren Sasoglu, E. Telatar, E. Yeh
Mathematics, Computer Science
IEEE Transactions on Information Theory
22 June 2010

Arikan's polar coding method is extended to two-user multiple-access channels, and the resulting channels will polarize to one of five possible extremals, on each of which uncoded transmission is optimal. Expand

On the construction of polar codes

Ramtin Pedarsani, Seyed Hamed Hassani, Ido Tal, E. Telatar
Mathematics, Computer Science
IEEE International Symposium on Information…
3 October 2011

We consider the problem of efficiently constructing polar codes over binary memoryless symmetric (BMS) channels. Expand

Recommended Authors