A relation between network computation and functional index coding problems

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 source messages. Similarly, in the functional index coding problem, the side information and demands of the clients include disjoint sets of functions of the information messages held by the transmitter instead of disjoint subsets of the messages, as is the case in the conventional index coding problem. It is known that any network coding problem can be transformed into an index coding problem and vice versa. In this paper, we establish a similar relationship between network computation problems and functional index coding problems. We show that any network computation problem can be converted into a functional index coding problem and vice versa. We prove that a solution for a network computation problem exists if and only if a functional index code (of a specific length determined by the network computation problem) for a suitably constructed functional index coding problem exists. Next, we show that a functional index coding problem admits a solution of a specified length if and only if a suitably constructed network computation problem admits a solution.