409 citations · 2.3k across the 154 of their papers we have counts for
4 papers · 2 filters
Communication Cost for Updating Linear Functions when Message Updates are Sparse: Connections to Maximally Recoverable Codes
N. Prakash, Muriel Medard
We consider a communication problem in which an update of the source message needs to be conveyed to one or more distant receivers that are interested in maintaining specific linea…
Maximum Entropy Functions: Approximate Gacs-Korner for Distributed Compression
Salman Salamatian, Asaf Cohen, Muriel Médard
Consider two correlated sources and generated from a joint distribution . Their Gács-Körner Common Information, a measure of common information that exploits the c…
Efficient Coding for Multi-source Networks using Gács-Körner Common Information
Salman Salamatian, Asaf Cohen, Muriel Médard
Consider a multi-source network coding problem with correlated sources. While the fundamental limits are known, achieving them, in general, involves a computational burden due to t…
Coding for Locality in Reconstructing Permutations
Netanel Raviv, Eitan Yaakobi, Muriel Medard
The problem of storing permutations in a distributed manner arises in several common scenarios, such as efficient updates of a large, encrypted, or compressed data set. This proble…