1 citations · 2 across the 3 of their papers we have counts for
5 papers
Scalar Solvability of Network Computation Problems and Representable Matroids
Anindya Gupta, B. Sundar Rajan
We consider the following \textit{network computation problem}. In an acyclic network, there are multiple source nodes, each generating multiple messages, and there are multiple si…
A Relation Between Network Computation and Functional Index Coding Problems
Anindya Gupta, B. Sundar Rajan
In contrast to the network coding problem wherein the sinks in a network demand subsets of the source messages, in a network computation problem the sinks demand functions of the s…
Reduced Complexity Sum-Product Algorithm for Decoding Network Codes and In-Network Function Computation
Anindya Gupta, B. Sundar Rajan
While the capacity, feasibility and methods to obtain codes for network coding problems are well studied, the decoding procedure and complexity have not garnered much attention. In…
Error-Correcting Functional Index Codes, Generalized Exclusive Laws and Graph Coloring
Anindya Gupta, B. Sundar Rajan
We consider the \emph{functional index coding problem} over an error-free broadcast network in which a source generates a set of messages and there are multiple receivers, each hol…
Decoding Network Codes using the Sum-Product Algorithm
Anindya Gupta, B. Sundar Rajan
While feasibility and obtaining a solution of a given network coding problem are well studied, the decoding procedure and complexity have not garnered much attention. We consider t…