Title :
Matroidal undirected network
Author_Institution :
Inst. of Network Coding, Chinese Univ. of Hong Kong, Hong Kong, China
Abstract :
The undirected graphical model is generalized to a linear matroid. The optimal direction for multicasting can be found in polynomial time with respect to the size of the network. A more general problem is also considered where certain function of a distributed source is to be computed at multiple nodes. The converse results are derived, not from the usual cut-set bound but through the related problem of secret key agreement and secure source coding by public discussion. A unifying model of partly directed network can also be formulated, covering both the directed and undirected networks as special cases.
Keywords :
network coding; telecommunication security; directed network; distributed source; linear matroid; matroidal undirected network; multicasting optimal direction; public discussion; secret key agreement problem; secure source coding; undirected graphical model; Multicast communication; Network coding; Polynomials; Source coding; Vectors;
Conference_Titel :
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
978-1-4673-2580-6
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2012.6283513