Efficient network code design for cyclic networks

Authors:
Elona Erez;Meir Feder
Affiliations:
Department of Electrical Engineering, Yale University, New Haven, CT and Department of Electrical Engineering Systems, Fleischman Faculty of Engineering, Tel-Aviv University, Tel-Aviv, Israel;Department of Electrical Engineering Systems, Fleischman Faculty of Engineering, Tel-Aviv University, Tel-Aviv, Israel
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 10
Cited 0

Polynomial time algorithms for network information flow

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Complexity classification of network information flow problems

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Essentially optimal computation of the inverse of generic polynomial matrices

Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Network coding theory: single sources

Communications and Information Theory
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction

IEEE Transactions on Information Theory
A separation theorem for single-source network coding

IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

This paper introduces an efficient polynomial-time code construction algorithm for cyclic networks, which achieves the optimal multicast rate. Until this work, no explicit capacity-achieving polynomial-time code construction for cyclic networks has been known. This new construction algorithm has the additional advantage that as sinks are added or removed from the network, it can modify the existing code in an efficient localized manner, which is beneficial also for acyclic networks. For decoding this code, a polynomial-time sequential decoder for convolutional network codes is also proposed.