Deterministic network coding by matrix completion
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Network coding: does the model need tuning?
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the capacity of information networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of matrix completion
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the capacity of information networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The encoding complexity of network coding
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The multicast capacity of deterministic relay networks with no interference
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
Minimum-cost multicast over coded packet networks
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
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Network coding theory: single sources
Communications and Information Theory
Network coding for routability improvement in VLSI
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
On packet lengths and overhead for random linear coding over the erasure channel
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Embracing wireless interference: analog network coding
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Foundations and Trends® in Networking
Utility maximization in peer-to-peer systems
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Incentive-compatible opportunistic routing for wireless networks
Proceedings of the 14th ACM international conference on Mobile computing and 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
EURASIP Journal on Wireless Communications and Networking
Combinatorial algorithms for wireless information flow
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Strongly Secure Linear Network Coding
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On proper secrets, (t, k)-bases and linear codes
Designs, Codes and Cryptography
Interactive Communication, Diagnosis and Error Control in Networks
Algorithmics of Large and Complex Networks
General Scheme for Perfect Quantum Network Coding with Free Classical Communication
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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
Multicast redux: a first look at enterprise multicast traffic
Proceedings of the 1st ACM workshop on Research on enterprise networking
Opportunistic use of client repeaters to improve performance of WLANs
IEEE/ACM Transactions on Networking (TON)
Training overhead for decoding random linear network codes in wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Improving the multicommodity flow rates with network codes for two sources
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Network coding: a computational perspective
IEEE Transactions on Information Theory
Coding and control for communication networks
Queueing Systems: Theory and Applications
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
A new construction method for networks from matroids
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
To code or not to code: rate optimality in node-capacitated networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Design of efficient robust network codes for multicast connections
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Existence and construction of capacity-achieving network codes for distributed storage
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Feasible alphabets for communicating the sum of sources over a network
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Separate network coding for private and common messages from one source to two sinks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Existence and construction of capacity-achieving network codes for distributed storage
IEEE Journal on Selected Areas in Communications
A constant bound on throughput improvement of multicast network coding in undirected networks
IEEE Transactions on Information Theory
Strategies of reliable transmission in practical network coding system
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
On-chip bidirectional wiring for heavily pipelined systems using network coding
ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
Network coding is highly non-approximable
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On the multiple unicast network coding conjecture
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Low-complexity non-uniform demand multicast network coding problems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Explicit construction of optimal exact regenerating codes for distributed storage
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Retransmission strategies of the generation-based network coding in packet networks
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Unified construction algorithm of network coding in cyclic networks
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
1 + N network protection for mesh networks: network coding-based protection using p-cycles
IEEE/ACM Transactions on Networking (TON)
Against wiretappers without key: security is an intrinsic property of network coding
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Queueing analysis of a butterfly network for comparing network coding to classical routing
IEEE Transactions on Information Theory
Pruning network coding traffic by network coding: a new class of max-flow algorithms
IEEE Transactions on Information Theory
On the multimessage capacity region for undirected ring networks
IEEE Transactions on Information Theory
Variable-rate linear network coding
IEEE Transactions on Information Theory
RIPPLE authentication for network coding
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the impact of random losses on TCP performance in coded wireless mesh networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the index coding problem and its relation to network coding and matroid theory
IEEE Transactions on Information Theory
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
Path gain algebraic formulation for the scalar linear network coding problem
IEEE Transactions on Information Theory
Network coding for distributed storage systems
IEEE Transactions on Information Theory
Secure network coding against wiretapping and Byzantine attacks
EURASIP Journal on Wireless Communications and Networking
Rate control with pairwise intersession network coding
IEEE/ACM Transactions on Networking (TON)
Network-coding multicast networks with QoS guarantees
IEEE/ACM Transactions on Networking (TON)
Efficient congestion mitigation using congestion-aware steiner trees and network coding topologies
VLSI Design - Special issue on CAD for Gigascale SoC Design and Verification Solutions
Robust network codes for unicast connections: a case study
IEEE/ACM Transactions on Networking (TON)
A deterministic algorithm of single failed node recovery in MSR-based distributed storage systems
ACM SIGMETRICS Performance Evaluation Review
General Theory of Information Transfer and Combinatorics
Distributed network coding-based opportunistic routing for multicast
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Network coding for unicast in a WiFi hotspot: Promises, challenges, and testbed implementation
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the queueing behavior of inter-flow asynchronous network coding
Computer Communications
Optimal bandwidth sharing in multiswarm multiparty P2P video-conferencing systems
IEEE/ACM Transactions on Networking (TON)
Utility maximization in peer-to-peer systems with applications to video conferencing
IEEE/ACM Transactions on Networking (TON)
XORing elephants: novel erasure codes for big data
Proceedings of the VLDB Endowment
Adaptive Information Coding for Secure and Reliable Wireless Telesurgery Communications
Mobile Networks and Applications
Benefits of network coding for unicast application in disruption-tolerant networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 755.50 |
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 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 re-encode the information they receive. We demonstrate examples of networks where the achievable rates obtained by coding at intermediate nodes are arbitrarily larger than if coding is not allowed. We give deterministic polynomial time algorithms and even faster randomized algorithms for designing linear codes for directed acyclic graphs with edges of unit capacity. We extend these algorithms to integer capacities and to codes that are tolerant to edge failures.