Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. Traskov, N. Ratnakar, D. Lun, R. Koetter, M. Médard (2006)
Network Coding for Multiple Unicasts: An Approach based on Linear Optimization2006 IEEE International Symposium on Information Theory
Danilo Silva, F. Kschischang, R. Koetter (2007)
A Rank-Metric Approach to Error Control in Random Network CodingIEEE Transactions on Information Theory, 54
(2013)
Anonymous and Security Network Coding
T. Ho, M. Médard, R. Koetter, David Karger, M. Effros, Jun Shi, B. Leong (2006)
A Random Linear Network Coding Approach to MulticastIEEE Transactions on Information Theory, 52
(1985)
Theory of Codes with Maximum Rank Distance, Probl
EM Gabidulin (1985)
Theory of Codes with Maximum Rank DistanceProbl. Peredachi Inf., 21
Danilo Silva, F. Kschischang (2008)
Universal Secure Network Coding via Rank-Metric CodesIEEE Transactions on Information Theory, 57
R. Ahlswede, N. Cai, S. Li, R. Yeung (2000)
Network information flowIEEE Trans. Inf. Theory, 46
L. Ozarow, A. Wyner (1984)
Wire-tap channel IIAT&T Bell Laboratories Technical Journal, 63
Chun Meng, H. Seferoglu, A. Markopoulou, K. Shum, Chung Chan (2013)
Multicast packing for coding across multiple unicasts2013 International Symposium on Network Coding (NetCod)
A. Lehman, E. Lehman (2004)
Complexity classification of network information flow problems
We propose a method for providing anonymity and security of data transmission in networks with network coding with multiple sources and receivers. An external passive adversary is assumed to be present in the network. It is required to organize message transmission in such a manner that the adversary cannot trace a message route. The proposed method is a modification of a secure transmission scheme based on coset coding. We show that using an additional operation at relaying nodes enables to remove statistical dependence between incoming and outgoing messages of the relaying nodes. This makes tracing message routes impossible. An overlay network between a source and a receiver must be constructed due to restrictions on routes between the source and receiver: the minimum cut between two successive nodes must be not less than the number of packets in the encoded source message.
Problems of Information Transmission – Springer Journals
Published: Apr 16, 2015
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.