Login / Signup
Communication Cost for Updating Linear Functions When Message Updates are Sparse: Connections to Maximally Recoverable Codes.
N. Prakash
Muriel Médard
Published in:
IEEE Trans. Inf. Theory (2018)
Keyphrases
</>
communication cost
linear functions
sensor networks
communication overhead
upper bound
processing cost
boolean functions
data distribution
high dimensional
location updates
objective function
data availability
dynamic programming
reduce communication cost
knapsack problem