• Publications
  • Influence
Capacity of Multi-antenna Gaussian Channels
  • E. Telatar
  • Computer Science
  • Eur. Trans. Telecommun.
  • 1 November 1999
TLDR
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
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
  • 855
  • 76
  • PDF
On the rate of channel polarization
  • E. Arıkan, E. Telatar
  • Physics, Computer Science
  • IEEE International Symposium on Information…
  • 24 July 2008
TLDR
A bound is given on the rate of channel polarization. Expand
  • 454
  • 37
  • PDF
Capacity and mutual information of wideband multipath fading channels
TLDR
We investigate the capacity and mutual information of a broadband fading channel consisting of a finite number of time-varying paths. Expand
  • 360
  • 23
  • PDF
Polarization for arbitrary discrete memoryless channels
TLDR
Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary discrete memoryless channels. Expand
  • 295
  • 22
  • PDF
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
TLDR
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
  • 146
  • 20
  • PDF
Combining Queueing Theory with Information Theory for Multiaccess
TLDR
We develop and analyze a multiaccess communication model over the additive Gaussian noise channel that incorporates some queueing-theoretic aspects. Expand
  • 207
  • 17
  • PDF
Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit
TLDR
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
  • 192
  • 16
  • PDF
Polar Codes for the Two-User Multiple-Access Channel
TLDR
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
  • 114
  • 15
  • PDF
On the construction of polar codes
TLDR
We consider the problem of efficiently constructing polar codes over binary memoryless symmetric (BMS) channels. Expand
  • 120
  • 9
  • PDF