no code implementations • 11 Sep 2023 • Yuzhou Gu, Ziqi Zhou, Onur Günlü, Rafael G. L. D'Oliveira, Parastoo Sadeghi, Muriel Médard, Rafael F. Schaefer
In this framework, datasets are nodes in a graph, and two neighboring datasets are connected by an edge.
no code implementations • 8 Feb 2022 • Ziqi Zhou, Onur Günlü, Rafael G. L. D'Oliveira, Muriel Médard, Parastoo Sadeghi, Rafael F. Schaefer
We extend a previous framework for designing differentially private (DP) mechanisms via randomized graph colorings that was restricted to binary functions, corresponding to colorings in a graph, to multi-valued functions.
no code implementations • 2 Feb 2021 • Arman Sharififar, Parastoo Sadeghi, Neda Aboutorab
Insufficiency of linear coding for the network coding problem was first proved by providing an instance which is solvable only by nonlinear network coding (Dougherty et al., 2005). Based on the work of Effros, et al., 2015, this specific network coding instance can be modeled as a groupcast index coding (GIC)instance with 74 messages and 80 users (where a message can be requested by multiple users).
Information Theory Information Theory
no code implementations • 21 Aug 2015 • Ni Ding, Parastoo Sadeghi, Rodney A. Kennedy
We also show that, due to the L-natural-convexity of DP, the variation of the optimal policy in queue state is restricted by a bounded marginal effect: The increment of the optimal policy between adjacent queue states is no greater than one.
no code implementations • 29 Oct 2013 • Ni Ding, Parastoo Sadeghi, Rodney A. Kennedy
This paper considers a transmission control problem in network-coded two-way relay channels (NC-TWRC), where the relay buffers random symbol arrivals from two users, and the channels are assumed to be fading.