33 citations · 139 across the 42 of their papers we have counts for
5 papers · 1 filter
Sum-networks from undirected graphs: construction and capacity analysis
Ardhendu Tripathy, Aditya Ramamoorthy
We consider a directed acyclic network with multiple sources and multiple terminals where each terminal is interested in decoding the sum of independent sources generated at the so…
Sum-networks from incidence structures: construction and capacity analysis
Ardhendu Tripathy, Aditya Ramamoorthy
A sum-network is an instance of a network coding problem over a directed acyclic network in which each terminal node wants to compute the sum over a finite field of the information…
Coded Caching with Low Subpacketization Levels
Li Tang, Aditya Ramamoorthy
Caching is popular technique in content delivery networks that allows for reductions in transmission rates from the content-hosting server to the end users. Coded caching is a gene…
Coded Caching for Networks with the Resolvability Property
Li Tang, Aditya Ramamoorthy
Coded caching is a recently proposed technique for dealing with large scale content distribution over the Internet. As in conventional caching, it leverages the presence of local c…
On Computation Rates for Arithmetic Sum
Ardhendu Tripathy, Aditya Ramamoorthy
For zero-error function computation over directed acyclic networks, existing upper and lower bounds on the computation capacity are known to be loose. In this work we consider the…