Home

Person

Emre Telatar

About
Privacy
Disclaimer

Graph Chatbot

Related publications (40)

Page 1 of 2

On Sampling and Coding for Distributed Acoustic Sensing

Martin Vetterli, Emre Telatar, Robert Konsbruck

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

Content Based Status Updates

Emre Telatar, Rajai Nasser, Elie Najm

Consider a stream of status updates generated by a source, where each update is of one of two types: high priority or ordinary (low priority). These updates are to be transmitted through a network to a monitor. However, the transmission policy of each pack ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

On Cooperative Wireless Network Secrecy

Suhas Diggavi, Emre Telatar, Etienne Perron

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

Polar Codes for the m-User Multiple Access Channel

Emre Telatar, Emmanuel Abbé

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

Optimal Age over Erasure Channels

Emre Telatar, Rajai Nasser, Elie Najm

Given a source that produces a letter every T-s seconds and an erasure channel that can be used every T-c seconds, we ask what is the coding strategy that minimizes the time-average "age of information" that an observer of the channel output incurs. We wil ...

IEEE2019

Polar Codes for Arbitrary DMCs and Arbitrary MACs

Emre Telatar, Rajai Nasser

Polar codes are constructed for arbitrary channels by imposing an arbitrary quasi-group structure on the input alphabet. Just as with usual polar codes, the block error probability under successive cancellation decoding is O(2^(-N^(1/2-epsilon))), where N ...

Institute of Electrical and Electronics Engineers2016

Content Based Status Updates

Emre Telatar, Rajai Nasser, Elie Najm

Consider a stream of status updates generated by a source, where each update is of one of two types: priority or ordinary; these updates are to be transmitted through a network to a monitor. We analyze a transmission policy that treats updates depending on ...

IEEE2018

On Noise Insertion Strategies for Wireless Network Secrecy

Suhas Diggavi, Emre Telatar, Etienne Perron

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

Finite-Level Quantization Procedures for Construction and Decoding of Polar Codes

Emre Telatar, Yunus Inan

We consider finite-level, symmetric quantization procedures for construction and decoding of polar codes. Whether polarization occurs in the presence of quantization is not known in general. In [1], it is shown that a simple three-level quantization proced ...

IEEE2020

Variable length coding over an unknown channel

Emre Telatar, Aslan Tchamkerten

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

A Fundamental Limit of Distributed Hypothesis Testing Under Memoryless Quantization

Ali H. Sayed, Emre Telatar, Mert Kayaalp, Yunus Inan

We consider a distributed binary hypothesis testing setup where multiple nodes send quantized information to a central processor, which is oblivious to the nodes' statistics. We study the regime where the missed detection (type-II error) probability decays ...

IEEE2022

Adaptive sensing using deterministic partial Hadamard matrices

Emre Telatar, Emmanuel Abbé, 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 MAC

Emre Telatar, Emmanuel Abbé

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

Institute of Electrical and Electronics Engineers2012

On the Arithmetic and Geometric Fusion of Beliefs for Distributed Inference

Ali H. Sayed, Emre Telatar, Mert Kayaalp, Yunus Inan

We study the asymptotic learning rates of belief vectors in a distributed hypothesis testing problem under linear and log-linear combination rules. We show that under both combination strategies, agents are able to learn the truth exponentially fast, with ...

Ieee-Inst Electrical Electronics Engineers Inc2024

On the Transmission of Bursty Sources

Emre Telatar, Stéphane Musy

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

Lossy Source Coding with Gaussian or Erased Side-Information

Suhas Diggavi, Emre Telatar, Etienne Perron

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

Wireless Network Secrecy with Public Feedback

Suhas Diggavi, Emre Telatar, Etienne Perron

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

On the use of training sequences for channel estimation

Emre Telatar, Aslan Tchamkerten

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

Optima Age Over Erasure Channels

Emre Telatar, Rajai Nasser, Elie Najm

Previous works on age of information and erasure channels have dealt with specific models and computed the average age or average peak age for certain settings. In this paper, given a source that produces a letter every T-s seconds and an erasure channel t ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

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