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 kurtosis of a signal is a quantitative measure of how

peaky' it is. In this paper we consider two scenarios of communication over fading channels with kurtosis constraints: in the first, we analyze a non-coherent Rayleigh fading channel where the input signal is required to satisfy a kurtosis constraint in addition to a power constraint. In the second, we find the

worst' fading process that satisfies a kurtosis constraint and has a given second moment, while the fading coefficients are assumed to be k

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

Arikan's polar coding method is extended to two-user multiple-access channels. It is shown that if the two users of the channel use Arikan's construction, the resulting channels will polarize to one of five possible extremals, on each of which uncoded tran ...

Communication over unknown discrete memoryless channels with instantaneous and perfect feedback is considered. For a given set of channels we define a notion of optimal coding schemes in terms of achievable rate and error exponent, and prove the existence of such coding schemes for two families of channels

We consider communication over a time invariant discrete memoryless channel with noiseless and instantaneous feedback. We assume that the communicating parties are not aware of the underlying channel, however they know that it belongs to some specific family of discrete memoryless channels. Recent results (A. Tchamkerten and I.E. Telatar) show that for certain families (e.g., binary symmetric channels and Z channels) there exists coding schemes that universally achieve any rate below capacity while attainin

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

Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. The block error probability under successive cancellation decoding decays exponentially with the square root of the block length. It is ...

We consider the rate-distortion problem for recording a Gaussian acoustic field with an array of sensors equipped with microphones. Our analysis is based on the field's spatiotemporal correlation structure, which is induced by the physics of sound propagation. Under certain assumptions about the spectrum of the wave kernel, we determine the rate-distortion functions for various distributed source coding schemes and sampling lattices. Our results also include an answer to the multiterminal rate-distortion pr

A polarization phenomenon in a special sense is shown for an arbitrary discrete memoryless channel (DMC) by imposing a quasigroup structure on the input alphabet. The same technique is used to derive a polarization theorem for an arbitrary multiple access ...

In this work, we introduce a setup where a monitoring entity attempts to distinguish a cheating player among a group of regular players where all players behave in order to maximize their reward. We assume that the cheating player has an "information advan ...

We consider multiple antenna systems in which a large number of antennas occupy a given physical volume. In this regime the assumptions of the standard models of multiple antennas systems become questionable. We show that for such spatially dense multiple antenna systems one should expect the behavior of the capacity to be qualitatively different than what the standard multiple antenna models predict.

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

We derive an information theoretic upper bound on the maximum achievable rate per communication pair in a large extended ad-hoc wireless network. We show that under a reasonably weak assumption on the attenuation due to environment, this rate tends to zero as the number of users gets large.

We propose a simple model to study the tradeoff between timeliness and distortion, where different pieces of data have a different cost of not being sent. We pose the question of finding the optimal tradeoff as a policy design problem amenable to dynamic programming methods. We study the structural properties of optimal transmission policies, give an algorithmic procedure to find the optimal tradeoff, and numerically evaluate some instances.

In this paper we consider information-theoretically secure communication between two special nodes ("source" and "destination") in a memoryless network with authenticated relays, where the secrecy is with respect to a class of eavesdroppers. We develop achievable secrecy rates when authenticated relays also help increase secrecy rate by inserting noise into the network.

Decoders employing the generalized likelihood ratio test can achieve rates that can be achieved by maximum likelihood decoders on ISI channels even though they are ignorant of the channel characteristics

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

Emre Telatar

Chattez avec Graph Search

Kurtosis Constraints In Communication Over Fading Channels

A Simple Converse of Burnashev's Reliability Function

Polar Codes for the Two-User Multiple-Access Channel

Optimal feedback schemes over unknown channels

On the universality of Burnashev's error exponent

The Interference-Multiple-Access Channel

Optimal feedback schemes over unknown channels

Polar coding for arbitrary DMCs

On the Multiterminal Rate-Distortion Function for Acoustic Sensing

Polarization Theorems for Arbitrary DMCs

Optimal Policies for Age and Distortion in a Discrete-Time Model

Safety in Numbers: Asymptotic Analysis of a Monitoring Problem

Dense multiple antenna systems

Dense multiple antenna systems

Spatio-Temporal Sampling and Distributed Compression of the Sound Field

Information theoretic upper bounds on the capacity of large extended ad-hoc wireless networks

Optimal Policies for Age and Distortion in a Discrete-Time Model

On cooperative secrecy for discrete memoryless relay networks

Gaussian ISI channels and the generalized likelihood ratio test

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