Recherche

Afficher tous les résultats pour

Accueil

Personne

Emre Telatar

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (40)

On Sampling and Coding for Distributed Acoustic Sensing

Martin Vetterli, Robert Konsbruck, Emre Telatar

The issue of how to efficiently represent the data collected by a network of microphones recording spatio-temporal acoustic wave fields is addressed. Each sensor node in the network samples the sound field, quantizes the samples and transmits the encoded s ...

2012

Adaptive sensing using deterministic partial Hadamard matrices

Emmanuel Abbé, Emre Telatar, Saeid Haghighatshoar

This paper investigates the construction of determin- istic measurement matrices preserving the entropy of a random vector with a given probability distribution. In particular, it is shown that for a random vector with i.i.d. discrete components, this is a ...

Ieee2012

Polar Codes for the m-User Multiple Access Channel

Emmanuel Abbé, Emre Telatar

In this paper, polar codes for the m-user multiple access channel (MAC) with binary inputs are constructed. It is shown that Arikan's polarization technique applied individually to each user transforms independent uses of an m-user binary input MAC into su ...

Institute of Electrical and Electronics Engineers2012

An empirical scaling law for polar codes

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

IEEE2010

A Simple Converse of Burnashev's Reliability Function

Bixio Rimoldi, Emre Telatar, Peter Allan Berlin

In a remarkable paper published in 1976, Burna- shev determined the reliability function of variable-length block codes over discrete memoryless channels (DMCs) with feedback. Subsequently, an alternative achievability proof was obtained by Yamamoto and It ...

2009

On Noise Insertion Strategies for Wireless Network Secrecy

Etienne Perron, Emre Telatar, Suhas Diggavi

We provide lower and upper bounds on the optimal rate for reliable and secret transmission of a message from one node to another in an arbitrary wireless network with deterministic signal interaction. Certain relay nodes are allowed to insert noise into th ...

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

Lossy Source Coding with Gaussian or Erased Side-Information

Etienne Perron, Emre Telatar, Suhas Diggavi

In this paper we find properties that are shared between two seemingly unrelated lossy source coding setups with side-information. The first setup is when the source and side-information are jointly Gaussian and the distortion measure is quadratic. The sec ...

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

The Interference-Multiple-Access Channel

Etienne Perron, Emre Telatar, Suhas Diggavi

We introduce the interference-multiple-access channel, which is a discrete memoryless channel with two transmitters and two receivers, similar to the interference channel. One receiver is required to decode the information encoded at one transmitter, the o ...

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

On Cooperative Wireless Network Secrecy

Etienne Perron, Emre Telatar, Suhas Diggavi

Given that wireless communication occurs in a shared and inherently broadcast medium, the transmissions are vulnerable to undesired eavesdropping. This occurs even when a point-to-point communication is sought, and hence a fundamental question is whether w ...

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

Wireless Network Secrecy with Public Feedback

Etienne Perron, Emre Telatar, Suhas Diggavi

In this paper we consider secret communication between two special nodes ("source" and "destination") in a wireless network with authenticated relays: the message communicated to the destination is to be kept information-theoretically (unconditionally) sec ...

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

Fountain Capacity

Emre Telatar

Fountain codes are currently employed for reliable and efficient transmission of information via erasure channels with unknown erasure rates. This correspondence introduces the notion of fountain capacity for arbitrary channels. In contrast to the conventi ...

2007

Spatio-Temporal Sampling and Distributed Compression of the Sound Field

Martin Vetterli, Robert Konsbruck, Luciano Sbaiz, Olivier Roy, Emre Telatar, Thibaut Ajdler

We investigate how the sound field induced by an acoustic event evolves over space and time. The characteristics of its bidimensional Fourier spectrum are analyzed and spatio-temporal sampling results using an array of microphones are provided for differen ...

2006

On the Role of Encoder Side-Information in Source Coding for Multiple Decoders

Etienne Perron, Emre Telatar, Suhas Diggavi

2006

On the use of training sequences for channel estimation

Aslan Tchamkerten, Emre Telatar

Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, with perfect, causal output feedback for communication. We study a scenario where communication is carried by first testing the channel by means of a training ...

2006

On the Transmission of Bursty Sources

Stéphane Musy, Emre Telatar

Traditionally, the bursty nature of data sources is not taken in consideration by information theory. Random arrival times typically are assumed to be smoothed out by appropriate source coding, rendering any meaningful analysis of the end-to-end delay impo ...

2006

Impacts of Channel Variability on Link-Level Throughput in Wireless Networks

Patrick Thiran, Emre Telatar

We study analytically and experimentally the throughput of the packetized time-varying discrete erasure channel with feedback, which closely captures the behavior of many practical physical layers. We observe that the channel variability at different time ...

2006

Variable length coding over an unknown channel

Aslan Tchamkerten, Emre Telatar

Burnashev in 1976 gave an exact expression for the reliability function of a discrete memoryless channel (DMC) with noiseless feedback. A coding scheme that achieves this exponent needs, in general, to know the statistics of the channel. Suppose now that t ...

2006

Information-Theoretic Upper Bounds on the Capacity of Large Extended Ad Hoc Wireless Networks

Olivier Lévêque, Emre Telatar

We derive an information-theoretic upper bound on the rate per communication pair in a large ad hoc wireless network. We show that under minimal conditions on the attenuation due to the environment and for networks with a constant density of users, this ra ...

2005

On the universality of Burnashev's error exponent

Aslan Tchamkerten, Emre Telatar

We consider communication over a time-invariant discrete memoryless channel (DMC) with noiseless and instantaneous feedback. We assume that the transmitter and the receiver are not aware of the underlying channel, however, they know that it belongs to some ...

2005

Impact of correlation and coupling on the capacity of MIMO systems

Bixio Rimoldi, Nicolae Chiurtu, Emre Telatar, Volker Pauli

In this work, we consider the multiple antenna systems in which a large number of antennas occupy a given physical volume, and investigate the behavior of the capacity when increasing the number of antennas. In this regime the assumptions of the standard m ...

2004

Page 2 sur 2