Soft x-ray diffraction of striated muscle
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
We consider the scenario in which a set of sources generates messages in a network and a receiver node demands an arbitrary linear function of these messages. We formulate an algebraic test to determine whether an arbitrary network can compute linear functions using linear codes. We identify a class of linear functions that can be computed using linear codes in every network that satisfies a natural cut-based condition. Conversely, for another class of linear functions, we show that the cut-based condition does not guarantee the existence of a linear coding solution. For linear functions over the binary field, the two classes are complements of each other. © 1963-2012 IEEE.
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine