Skip to main content

Search

Show all results for

Home

Person

Etienne Perron

This person is no longer with EPFL

About
Privacy
Disclaimer

Copyright © 2026 EPFL, all rights reserved

Graph Chatbot

Related publications (8)

Page 1 of 1

Using Three States for Binary Consensus on Complete Graphs

Etienne Perron, Dinkar Vasudevan, Milan Vojnovic

We consider the binary consensus problem where each node in the network initially observes one of two states and the goal for each node is to eventually decide which one of the two states was initially held by the majority of the nodes. Each node contacts ...

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

Information-theoretic secrecy for wireless networks

The aim of information-theoretic secrecy is to ensure that an eavesdropper who listens to the wireless transmission of a message can only collect an arbitrarily small number of information bits about this message. In contrast to cryptography, there are no ...

EPFL2009

On Noise Insertion Strategies for Wireless Network Secrecy

Emre Telatar, Suhas Diggavi, 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

Lossy Source Coding with Gaussian or Erased Side-Information

Emre Telatar, Suhas Diggavi, 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

The Interference-Multiple-Access Channel

Emre Telatar, Suhas Diggavi, Etienne Perron

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

Emre Telatar, Suhas Diggavi, 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

Wireless Network Secrecy with Public Feedback

Emre Telatar, Suhas Diggavi, 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 Role of Encoder Side-Information in Source Coding for Multiple Decoders

Emre Telatar, Suhas Diggavi, Etienne Perron

2006