Publications by Suhas Diggavi | EPFL Graph Search

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

We consider multiple description (MD) coding for the Gaussian source with K descriptions under the symmetric mean-squared error (MSE) distortion constraints, and provide an approximate characterization of the rate region. We show that the rate region can b ...

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

Group testing is a technique that can reduce the number of tests needed to identify infected members in a population, by pooling together multiple diagnostic samples. Despite the variety and importance of prior results, traditional work on group testing ha ...

The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic id ...

Diversity embedded codes are high-rate space-time codes that have a high-diversity code embedded within them. They allow a form of communication where the high-rate code opportunistically takes advantage of good channel realizations while the embedded high ...

We consider the problem of transmitting a Gaussian source on a slowly fading Gaussian channel, subject to the mean-squared error distortion measure. The channel state information is known only at the receiver but not at the transmitter. The source is assum ...

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

We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the ...

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

Rate and diversity impose a fundamental tradeoff in communications. This tradeoff was investigated for Intersymbol Interference (ISI) channels in [4]. A different point of view was explored in [1] where high-rate codes were designed so that they have a hig ...

Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...

We consider the scenario where a group of wireless nodes want to exchange a secret key, such that no eavesdropper can guess the key. Today, this can be achieved using publickey cryptography, e.g., the Diffie-Hellman or the RSA keyexchange algorithms. Howev ...

In this paper we study interference management in wireless networks with bursty user traffic. In each time slot, whether a user is on or off for transmission is governed by its own Bernoulli random state. At each transmitter, the states of activities of ot ...

End-to-end active network monitoring infers network characteristics by sending and collecting probe packets from the network edge, while probes traverse the network through multicast trees or a mesh of unicast paths. Most reported methods consider given so ...

We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate l ...

We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feedback strictly, causally, and publicly their channel states after each transmission. We explore ...

We investigate source coding in a cascade communication system consisting of an encoder, a relay and an end terminal, where both the relay and the end terminal wish to reconstruct source

X

with certain fidelities. Additionally, side-informations

Z

and ...

Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This is of particular interest when either absolute coordinates for geographic routing ...

Networks need to accommodate diverse applications with different Quality-of-Service (QoS) requirements. New ideas at the physical layer are being developed for this purpose, such as diversity embedded coding, which is a technique that combines high rates w ...

Multiplexing rate and diversity impose a fundamental trade-off in wireless communications. This tradeoff was investigated for Inter-symbol Interference (ISI) channels in [8]. A different point of view was explored in [2], [5], [6] where high rate codes wer ...

Suhas Diggavi

Chat with Graph Search

Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion

On Cooperative Wireless Network Secrecy

Community-Aware Group Testing

Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems

Diversity Embedded Codes: Theory and Practice

Successive refinement via broadcast: Optimizing expected distortion of a Gaussian source over a Gaussian fading channel

Wireless Network Secrecy with Public Feedback

Triangle Network Secrecy

On Noise Insertion Strategies for Wireless Network Secrecy

On Successive Refinement of Diversity for fading ISI channels

Creating Secrets out of Erasures

Erased Secrets: Practical Information-Theoretic Group Secrecy

Interference Channels with Bursty Traffic and Delayed Feedback

Network Monitoring: it depends on your points of view

Exploiting Common Randomness: a Resource for Network Secrecy

Secret Communication Over Broadcast Erasure Channels With State-Feedback

Lossy source coding for a cascade communication system with side-informations

Robust Geo-Routing on Embeddings of Dynamic Wireless Networks

Optimal Delay-Rate-Reliabiliy Tradeoff in Networks with composite Links

Successive Refinement of Diversity for Fading ISI MISO Channels