98 citations · 444 across the 80 of their papers we have counts for
6 papers · 2 filters
Determining Optimal Rates for Communication for Omniscience
Ni Ding, Chung Chan, Qiaoqiao Zhou +2
This paper considers the communication for omniscience (CO) problem: A set of users observe a discrete memoryless multiple source and want to recover the entire multiple source via…
A Faster Algorithm for Asymptotic Communication for Omniscience
Ni Ding, Chung Chan, Qiaoqiao Zhou +2
We propose a modified decomposition algorithm (MDA) to solve the asymptotic communication for omniscience (CO) problem where the communication rates could be real or fractional. By…
User Load Analysis and Pilot Sequence Design for Multi-Cell Massive MIMO Networks
Noman Akbar, Nan Yang, Parastoo Sadeghi +1
We propose a novel algorithm to design user load-achieving pilot sequences that mitigate pilot contamination in multi-cell massive multiple-input multiple-output (MIMO) networks. T…
Distributed Index Coding
Parastoo Sadeghi, Fatemeh Arbabjolfaei, Young-Han Kim
In this paper, we study the capacity region of the general distributed index coding. In contrast to the traditional centralized index coding where a single server contains all …
Fairness in Communication for Omniscience
Ni Ding, Chung Chan, Qiaoqiao Zhou +2
We consider the problem of how to fairly distribute the minimum sum-rate among the users in communication for omniscience (CO). We formulate a problem of minimizing a weighted quad…
Delivery Time Reduction for Order-Constrained Applications using Binary Network Codes
Ahmed Douik, Mohammad S. Karim, Parastoo Sadeghi +1
Consider a radio access network wherein a base-station is required to deliver a set of order-constrained messages to a set of users over independent erasure channels. This paper st…