805 citations · 1.3k across the 11 of their papers we have counts for
4 papers · 1 filter
Probability of super-regular matrices and MDS codes over finite fields
Rathinakumar Appuswamy, Marco Bazzani, Spencer Congero +3
Let be an linear code chosen uniformly at random over a finite field of size . The following asymptotic probability of being maximum distance sepa…
Computing linear functions by linear coding over networks
Rathinakumar Appuswamy, Massimo Franceschetti
We consider the scenario in which a set of sources generate messages in a network and a receiver node demands an arbitrary linear function of these messages. We formulate an algebr…
Linear Codes, Target Function Classes, and Network Computing Capacity
Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani +1
We study the use of linear codes for network computing in single-receiver networks with various classes of target functions of the source messages. Such classes include reducible,…
Network Coding for Computing: Cut-Set Bounds
Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani +1
The following \textit{network computing} problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a targe…