摘要: Recent work on network coding renders a new view multicasting in network. In the paradigm of coding, nodes are allowed to encode information received from input links. The usual function switching at node is special case coding. advantage that full capacity can be utilized. this paper, we propose model which incorporates and security. Specifically, collection subsets links given, wiretapper access any one (but not more than one) these without being able obtain about message transmitted. Our includes secret sharing as case. We present construction secure linear codes provided certain graph-theoretic sufficient condition satisfied.
sci-hub.se 参考文章(4)
R. Koetter, M. Medard, An algebraic approach to network coding international symposium on information theory. pp. 104- ,(2001) , 10.1109/ISIT.2001.935967
R. Ahlswede, Ning Cai, S.-Y.R. Li, R.W. Yeung, Network information flow IEEE Transactions on Information Theory. ,vol. 46, pp. 1204- 1216 ,(2000) , 10.1109/18.850663
S.-Y.R. Li, R.W. Yeung, Ning Cai, Linear network coding IEEE Transactions on Information Theory. ,vol. 49, pp. 371- 381 ,(2003) , 10.1109/TIT.2002.807285
Adi Shamir, How to share a secret Communications of the ACM. ,vol. 22, pp. 612- 613 ,(1979) , 10.1145/359168.359176