Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Randomized metarounding (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Hardness of the Steiner Tree Problem on Graphs
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Finite field linear algebra subroutines
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Network coding: an instant primer
ACM SIGCOMM Computer Communication Review
A unification of network coding and tree-packing (routing) theorems
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On average throughput and alphabet size in network coding
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Matrix games in the multicast networks: maximum information flows with network switching
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On achieving maximum multicast throughput in undirected networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Cycle-logical treatment for "Cyclopathic" networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Network coding theory: single sources
Communications and Information Theory
Foundations and Trends® in Networking
On the Network Coding Advantage for Wireless Multicast in Euclidean Space
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Complexity of scheduling with analog network coding
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
On Field Size and Success Probability in Network Coding
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Average throughput with linear network coding over finite fields: the combination network case
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
An overview of network coding for dynamically changing networks
International Journal of Autonomous and Adaptive Communications Systems
Strongly Secure Linear Network Coding
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Interactive Communication, Diagnosis and Error Control in Networks
Algorithmics of Large and Complex Networks
Rate control for network coding based multicast: a hierarchical decomposition approach
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
On practical design for joint distributed source and network coding
IEEE Transactions on Information Theory
Rate Control, Routing Algorithm and Scheduling for Multicast with Network Coding in Ad Hoc Networks
AICI '09 Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence
An efficient dynamic-identity based signature scheme for secure network coding
Computer Networks: The International Journal of Computer and Telecommunications Networking
Algebraic codes for network coding
Problems of Information Transmission
A constant bound on throughput improvement of multicast network coding in undirected networks
IEEE Transactions on Information Theory
Unified construction algorithm of network coding in cyclic networks
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Efficient multipath in wireless networks using network coding over braided meshes
International Journal of Sensor Networks
Survey of network coding and its benefits in energy saving over wireless sensor networks
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Network coding-based reliable multicast in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network coding: an excellent approach for overloaded communication era
WSEAS TRANSACTIONS on COMMUNICATIONS
Efficient network code design for cyclic networks
IEEE Transactions on Information Theory
Pairwise intersession network coding on directed networks
IEEE Transactions on Information Theory
Network coding for distributed storage systems
IEEE Transactions on Information Theory
Network-coding multicast networks with QoS guarantees
IEEE/ACM Transactions on Networking (TON)
Linear-code multicast on parallel architectures
Advances in Engineering Software
A high-throughput overlay multicast infrastructure with network coding
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
General Theory of Information Transfer and Combinatorics
Network coding for unicast in a WiFi hotspot: Promises, challenges, and testbed implementation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multicast routing algorithm based on network coding
BICS'13 Proceedings of the 6th international conference on Advances in Brain Inspired Cognitive Systems
Authentication of lossy data in body-sensor networks for cloud-based healthcare monitoring
Future Generation Computer Systems
Hi-index | 0.30 |
The famous max-flow min-cut theorem states that a source node s can send information through a network (V,E) to a sink node t at a data rate determined by the min-cut separating s and t. Recently it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediate nodes are allowed to reencode the information they receive. In contrast, we present graphs where without coding the rate must be a factor Ω(log|V|) smaller. However, so far no fast algorithms for constructing appropriate coding schemes were known. Our main result are polynomial time algorithms for constructing coding schemes for multicasting at the maximal data rate.