Home

Person

Suhas Diggavi

This person has left EPFL

About
Privacy
Disclaimer

Graph Chatbot

Related publications (77)

Page 3 of 4

Code Construction for Multiple Sources Network Coding

Christina Fragouli, Suhas Diggavi

In several wireless applications multiple sources transmit information to one or more receivers, many times over unknown topologies. This is especially so in mobile networks where learning the topology may have prohibitive complexity. Network coding techni ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2009

On the capacity of multisource non-coherent network coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani, Soheil Mohajerzefreh

We consider multisource non-coherent network coding, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a ldquosubspacerdquo channel, that takes subspaces as inputs and outputs. We then show that the r ...

2009

Group testing for connected communities

Christina Fragouli, Suhas Diggavi, Pavlos Nikolopoulos

In this paper, we propose algorithms that leverage a known community structure to make group testing more efficient. We consider a population organized in disjoint communities: each individual participates in a community, and its infection probability depe ...

MICROTOME PUBLISHING2021

Approximate Capacity of a Class of Gaussian Interference-Relay Networks

Christina Fragouli, Suhas Diggavi, Soheil Mohajerzefreh

In this paper, we study a Gaussian relay-interference network, in which relay (helper) nodes are to facilitate competing information flows between different source-destination pairs. We focus on two-stage relay-interference networks where there are weak cr ...

Institute of Electrical and Electronics Engineers2011

On multicasting nested message sets over combination networks

Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

In this paper, we study delivery of two nested message sets over combination networks with an arbitrary number of receivers, where a subset of receivers (public receivers) demand only the lower priority message and a subset of receivers (private receivers) ...

Ieee2012

Identity Aware Sensor Networks

Christina Fragouli, Suhas Diggavi, Aikaterini Argyraki, Lorenzo Keller, Mahdi Jafari Siavoshani

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

2009

Group secret key agreement over state-dependent wireless broadcast channels

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

We consider a group of m trusted nodes that aim to create a shared secret key K, using a state-dependent wireless broadcast channel that exists from one of the honest nodes to the rest of the nodes including a passive eavesdropper Eve. All of the trusted n ...

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

Subspace properties of randomized network coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

Randomized network coding has network nodes randomly combine and exchange linear combinations of the source packets. A header appended to the packet, called coding vector, specifies the exact linear combination that each packet carries. The main contributi ...

2007

Asymmetric multi-level diversity coding

Suhas Diggavi, Soheil Mohajerzefreh

Symmetric multilevel diversity coding was introduced by Roche et al, where a set of K information sources is encoded by K encoders and the decoders reconstruct sources 1, . . . , k, where k is the number of encoders to which they have access. In this paper ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2008

Multiple Description Coding for Stationary Gaussian Sources

Suhas Diggavi

We consider the problem of multiple description coding for stationary Gaussian sources under the squared error distortion measure. The rate region is characterized for the 2-description case. It is shown that each supporting line of the rate region is achi ...

2009

On the capacity of non-coherent network coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani, Soheil Mohajerzefreh

We consider the problem of multicasting information from a source to a set of receivers over a network where interme- diate network nodes perform randomized linear network coding operations on the source packets. We propose a channel model for the noncoher ...

2011

A Deterministic Approach to Wireless Network Error Correction

Suhas Diggavi, Soheil Mohajerzefreh

In this paper we consider communication between two special nodes ("source" and "destination") in a wireless relay network, which has malfunctioning or malicious nodes (inserting errors). We develop the model for wireless network communication in the prese ...

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

Noncoherent multi-source network coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

We examine the problem of multiple sources transmitting information to one or more receivers that require the information from all the sources, over a network where the network nodes perform randomized network coding. We consider the noncoherent case, wher ...

2008

Multiple description coding for stationary and ergotic sources

Suhas Diggavi

IEEE Computer Society Press2007

On degraded two-message set broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P ⊆U . Transmissions occur over linear deterministic channels. For the case wher ...

2009

Towards integrating Quantize-Map-Forward relaying into LTE

Christina Fragouli, Suhas Diggavi, Emre Atsan

We present a method to integrate the Quantize-Map-Forward (QMF) relaying scheme [1] into the standard LTE operation, for a two-relay diamond network configuration. Our approach implements QMF using mainly existing LTE modules and functionalities, and resul ...

Ieee2012

Rank Distance Codes for ISI channel

Suhas Diggavi, Sanket Dusad

Designs for transmit alphabet constrained spacetime codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed by using sets of binary mat ...

2007

Multistage successive refinement for Wyner-Ziv source coding with degraded side informations

Suhas Diggavi

2006

Secret message capacity of erasure broadcast channels with feedback

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, László Czap

We characterize the secret message capacity of a wiretapped erasure channel where causal channel state informa- tion of the honest nodes is publicly available. In doing so, we establish an intimate connection between message secrecy and secret key generati ...

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

On Degrees of Freedom of Layered Two Unicast Networks with Delayed CSIT

Suhas Diggavi, I-Hsiang Wang

In this paper we study the two unicast information flow problem over layered Gaussian networks with arbitrary number of nodes and connectivity, under the model of delayed channel state information (CSI) at transmitters and instantaneous CSI at receivers. W ...

Ieee2012