The encoding complexity of network coding
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
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
Foundations and Trends® in Networking
On network coding in wireless ad-hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
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
Genetic Representations for Evolutionary Minimization of Network Coding Resources
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Network coding for undirected information exchange
IEEE Communications Letters
An effective genetic algorithm for the network coding problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Applying network coding to cyclic networks
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Dynamic network coding problem: an evolutionary approach
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Toward network coding-based protocols for data broadcasting in wireless ad hoc networks
IEEE Transactions on Wireless Communications
Low-complexity non-uniform demand multicast network coding problems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Unified construction algorithm of network coding in cyclic networks
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Pruning network coding traffic by network coding: a new class of max-flow algorithms
IEEE Transactions on Information Theory
Lifetime-resource tradeoff for multicast traffic in wireless sensor networks
IEEE Transactions on Wireless Communications
Protecting network coded packets in coalition networks
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
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
Data dissemination in wireless sensor networks with network coding
EURASIP Journal on Wireless Communications and Networking - Special issue on network coding for wireless networks
Multiple-user cooperative communications based on linear network coding
IEEE Transactions on Communications
A population based incremental learning for delay constrained network coding resource minimization
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II
An effective genetic algorithm for network coding
Computers and Operations Research
Entropy-based efficiency enhancement techniques for evolutionary algorithms
Information Sciences: an International Journal
Revisiting a secret sharing approach to network codes
ProvSec'12 Proceedings of the 6th international conference on Provable Security
IEEE/ACM Transactions on Networking (TON)
Information Sciences: an International Journal
| Hi-index | 755.02 |
We propose a method to identify structural properties of multicast network configurations, by decomposing networks into regions through which the same information flows. This decomposition allows us to show that very different networks are equivalent from a coding point of view, and offers a means to identify such equivalence classes. It also allows us to divide the network coding problem into two almost independent tasks: one of graph theory and the other of classical channel coding theory. This approach to network coding enables us to derive the smallest code alphabet size sufficient to code any network configuration with two sources as a function of the number of receivers in the network. But perhaps the most significant strength of our approach concerns future network coding practice. Namely, we propose deterministic algorithms to specify the coding operations at network nodes without the knowledge of the overall network topology. Such decentralized designs facilitate the construction of codes that can easily accommodate future changes in the network, e.g., addition of receivers and loss of links