Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
Foundations and Trends® in Networking
Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Applying network coding to cyclic networks
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Unified construction algorithm of network coding in cyclic networks
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Pruning network coding traffic by network coding: a new class of max-flow algorithms
IEEE Transactions on Information Theory
Robust network codes for unicast connections: a case study
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.06 |
This correspondence addresses the problem of finding the network encoding equations for error-free networks with multiple sources and sinks. Previous algorithms could not cope with cyclic networks. Networks that are cyclic in three different senses are considered in this correspondence, and two extensions of the polynomial time Linear Information Flow (LIF) algorithm are presented. The first algorithm will produce the network encoding equations for a network which can be cyclic, unless the actual flow paths form cycles. The second algorithm will work also when the flow paths form simple cycles. Finally an example of a third kind of cyclic network, where the previous algorithms will fail, is given. However, a binary encoding is provided also in this case.