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.

Consider a source, Alice, broadcasting private messages to multiple receivers through a broadcast erasure channel; users send back to Alice public feedback that she causally uses to decide the coding strategy for her following transmissions. Recently, the ...

The topology of a mobile wireless network changes over time. Maintaining routes between all nodes requires the continuous transmission of control information, which consumes precious power and bandwidth resources. Many routing protocols have been developed ...

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

Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedba ...

In multi-terminal communication systems, signals carrying messages meant for different destinations are often observed together at any given destination receiver. Han and Kobayashi (1981) proposed a receiving strategy which performs a joint unique decoding ...

This paper presents exact capacity characterizations for the case, when a principal, Alice, wants to securely send a message to another principal, Bob, over three network configurations: the parallel edges network, the V-network, and the triangle network. ...

We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high quality side information will be able to use only the first layer to reconstruct the so ...

In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit—for instance, in many cases, sensors are used to detect ...

Systems that employ network coding for content distribution convey to the receivers linear combinations of the source packets. If we assume randomized network coding, during this process the network nodes collect random subspaces of the space spanned by th ...

In this correspondence, we consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes to reconstruct in a successive-refinement fashion. ...

We consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. We show that the design of only a single network code for multicasting is sufficient to achie ...

Lossless transmission of a set of correlated sources over a deterministic relay network is considered for two traffic requirements. In distributed multicast, the set of sources are to be delivered to a set of destinations. The source exchange requires all ...

We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of 2(K) - 1 information sources, ordered in a decreasing level of importance, is encoded into K messages (or descriptions). There are 2(K) - 1 decoders, each of which has a ...

Secure network coding assumes that the underlying network channels are error-free; thus, if our channels introduce errors, we need to first apply a channel code to correct them, and then build security on top of the resulting error-free network. In this pa ...

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

Rate and diversity impose a fundamental trade-off in wireless communication. High-rate space-time codes come at a cost of lower reliability (diversity), and high reliability (diversity) implies a lower rate. However, wireless networks need to support appli ...

In this paper we study the relay-interference wireless network, in which relay (helper) nodes are to facilitate competing information ﬂows over a wireless network. We examine this in the context of a deterministic wireless interaction model, which eliminat ...

Current security systems typically rely on the adversary's computational limitations (e.g., the fact that it cannot invert a hash function or perform large-integer factorization). Wireless networks offer the opportunity for a different, complementary kind ...

We design a novel class of space-time codes, called linear diversity-embedding space-time block codes (LDE-STBC) where a high-rate STBC is linearly superimposed on a high-diversity STBC without requiring channel knowledge at the transmitter. In applying th ...

Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secre ...

Suhas Diggavi

Chat with Graph Search

Broadcasting Private Messages Securely

Hierarchical Routing Over Dynamic Wireless Networks

Lossy Source Coding with Gaussian or Erased Side-Information

Securing Broadcast Against Dishonest Receivers

Is non-unique decoding necessary?

An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback

Side-Information Scalable Source Coding

Joint Identity-Message Coding for Sensor Networks

Subspace properties of network coding and their applications

Multiuser successive refinement and multiple description coding

Network coding for undirected information exchange

On Source Transmission over Deterministic Relay Networks

Asymmetric Multilevel Diversity Coding and Asymmetric Gaussian Multiple Descriptions

Secure Network Coding With Erasures and Feedback

The Interference-Multiple-Access Channel

Diversity Embedded Space-Time Codes

Transmission techniques for relay-interference networks

Creating Shared Secrets out of Thin Air

Linear Diversity-Embedding STBC: Design Issues and Applications

Secure Network Coding with Erasures and Feedback