Publications de Emre Telatar | EPFL Graph Search

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 we can utilize the wireless channel properties to establish secrecy. 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 d

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 ...

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 ...

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 type-II error decays exponentially and the type-I error vanishes. For memoryless quantization, we characterize a tradeoff curve that yields a lower bound for the feasible region of type-II error exponents and the average number of bits sent under the null hypothesis. Moreover, we show that the tradeoff cur

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. This quantity has been studied extensively for single-letter decoding rules over discrete memoryless channels (DMCs). Here we extend the study to memoryless channels with general alphabets and to channels with memory with possibly non-single-letter decoding rules. We also study the wide-band limit, and, in particular, the mismatch capacity per

The transmission of one of two messages over a binary symmetric channels with perfect and instantaneous feedback is considered. We study the situation where transmitter and receiver want to communicated reliably and quickly. We propose a simple decoding rule, and show that it minimizes the weighted combination of the probability of error and decoding delay for a certain range of crossover probabilities and combination weights.

Polar coding is a recent channel coding technique invented by Arikan to achieve the 'symmetric capacity' of binary-input memoryless channels. Subsequently it was observed by Korada and Urbanke that such codes are also good for lossy channel coding, achieving the 'symmetric rate distortion' bound, when the representation alphabet is binary. In this note we extend this result to the case when the representation alphabet is q-ary, for q a prime number.

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 ...

Emre Telatar

Chattez avec Graph Search

On Sampling and Coding for Distributed Acoustic Sensing

Content Based Status Updates

On Cooperative Wireless Network Secrecy

Polar Codes for the m-User Multiple Access Channel

Optimal Age over Erasure Channels

Polar Codes for Arbitrary DMCs and Arbitrary MACs

Content Based Status Updates

On Noise Insertion Strategies for Wireless Network Secrecy

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

Variable length coding over an unknown channel

A Fundamental Limit of Distributed Hypothesis Testing Under Memoryless Quantization

Adaptive sensing using deterministic partial Hadamard matrices

On Cooperative Wireless Network Secrecy

On the Arithmetic and Geometric Fusion of Beliefs for Distributed Inference

On the Transmission of Bursty Sources

A Fundamental Limit of Distributed Hypothesis Testing Under Memoryless Quantization

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

Reliability and latency in binary communication

Polar Codes for Q-ary Source Coding

Lossy Source Coding with Gaussian or Erased Side-Information