An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
The encoding complexity of network coding
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Information Theory and Network Coding
Information Theory and Network Coding
Network Coding Fundamentals
Network Coding: An Introduction
Network Coding: An Introduction
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
An information-theoretic view of network management
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
Resilient Network Coding in the Presence of Byzantine Adversaries
IEEE Transactions on Information Theory
Coding for Errors and Erasures in Random Network Coding
IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We consider the problem of establishing reliable multicast connections across a communication network. Our goal is to provide instantaneous recovery from single edge failures. With instantaneous recovery, all destination nodes can decode the packets sent by the source node even if one of the edges in the network fails, without the need of retransmission or rerouting. We build on the novel technique of network coding that offers significant advantages over standard solutions such as disjoint path routing and diversity coding. We begin by focusing on the case in which all network edges have equal capacity. For this case we present a network coding algorithm that constructs a robust network code over a small field. The algorithm takes advantage of special properties of the Maximum Rank Distance codes. Second, we consider a case of non-uniform edge capacities. We show that for the special case in which a small number of packets need to be transmitted from the source to destination nodes, special combinatorial properties of minimum coding networks can be exploited for constructing efficient robust network codes.