88 citations · 163 across the 27 of their papers we have counts for
4 papers · 1 filter
Efficient Joint Network-Source Coding for Multiple Terminals with Side Information
Chen Avin, Michael Borokhovich, Asaf Cohen +1
Consider the problem of source coding in networks with multiple receiving terminals, each having access to some kind of side information. In this case, standard coding techniques a…
Order Optimal Information Spreading Using Algebraic Gossip
Chen Avin, Michael Borokhovich, Keren Censor-Hillel +1
In this paper we study gossip based information spreading with bounded message sizes. We use algebraic gossip to disseminate distinct messages to all nodes in a network. Fo…
Bounds for Algebraic Gossip on Graphs
Michael Borokhovich, Chen Avin, Zvi Lotker
We study the stopping times of gossip algorithms for network coding. We analyze algebraic gossip (i.e., random linear coding) and consider three gossip algorithms for information s…
Tales of Huffman
Paul M. B. Vitanyi, Zvi Lotker
We study the new problem of Huffman-like codes subject to individual restrictions on the code-word lengths of a subset of the source words. These are prefix codes with minimal expe…