#### Filter Results:

#### Publication Year

2008

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Mahdi Jafari Siavoshani, Soheil Mohajer, Christina Fragouli, Suhas N. Diggavi
- IEEE Transactions on Information Theory
- 2009

We consider the problem of multicasting information from a source to a set of receivers over a network where intermediate network nodes perform randomized linear network coding operations on the source packets. We propose a channel model for the noncoherent network coding introduced by Koetter and Kschischang in , that captures the essence of such a network… (More)

- Mahdi Jafari Siavoshani, Lorenzo Keller, Christina Fragouli, Katerina J. Argyraki
- 2009 IEEE International Symposium on Information…
- 2009

In networks that employ network coding, two main approaches have been proposed in the literature to allow the receivers to recover the source information: (i) use of coding vectors, that keep track of the linear combinations the received packets contain, and (ii) subspace coding, that dispenses of the need to know the linear combinations, since information… (More)

- Mahdi Jafari Siavoshani, Christina Fragouli
- 2012 International Symposium on Network Coding…
- 2012

We consider a group of m+1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear non-coherent network coding broadcast channel (over a finite field F<sub>q</sub>) from one of the honest nodes (i.e., Alice) to the rest of them including Eve. All of the trusted nodes can also… (More)

- Mahdi Jafari Siavoshani, Christina Fragouli, Suhas N. Diggavi
- 2008 IEEE International Symposium on Information…
- 2008

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, where neither the sources nor the receivers have any knowledge of the intermediate nodes operations. We… (More)

- Mahdi Jafari Siavoshani, U. Pulleti, +4 authors Suhas N. Diggavi
- ArXiv
- 2011

We consider the problem where a group of n nodes, connected to the same broadcast channel (e.g., a wireless network), want to generate a common secret bitstream, in the presence of an adversary Eve, who tries to obtain information on the bitstream. We assume that the nodes initially share a (small) piece of information, but do not have access to any… (More)

- Vitaly Skachek, Olgica Milenkovic, +25 authors Qifu Tyler Sun
- 2012

In a significant class of sensor-network applications, the identities of the reporting sensors are an essential part of the reported information. For instance, in environmental monitoring , the goal is to reconstruct physical quantities over space and time; these quantities are sampled by the sensors , and the source identity associated with each… (More)

- Mahdi Jafari Siavoshani, Shaunak Mishra, Christina Fragouli, Suhas N. Diggavi
- 2011 IEEE International Symposium on Information…
- 2011

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 nodes can also discuss over a cost-free and unlimited rate public channel which is also observed by Eve.… (More)

- Mahdi Jafari Siavoshani, Christina Fragouli, Suhas N. Diggavi
- IEEE Transactions on Information Theory
- 2012

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 the source packets. We establish several fundamental properties of the random subspaces induced in such… (More)

- Javad B. Ebrahimi, Mahdi Jafari Siavoshani
- 2014 IEEE Information Theory Workshop (ITW 2014)
- 2014

In this work, we study the problem of index coding from graph homomorphism perspective. We show that the minimum broadcast rate of an index coding problem for different variations of the problem such as non-linear, scalar, and vector index code, can be upper bounded by the minimum broadcast rate of another index coding problem when there exists a… (More)