Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Plücker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words.

This paper points out connections between linear network coding and linear system theory. In particular, a network code is interpreted as a state space realization of a network behavior that implements a desired set of network connections. A reversibility theorem is derived for network coding that is a direct consequence of a fundamental duality theorem derived by Forney in the context of state...

Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual methods for constructing cyclic subspace codes over finite fields works for m-quasi cyclic codes, namely the subspaces polynomials and Frobenius mappings.

Survivability is an important network characteristic that provides a certain level of data delivery guarantees. The degree of survivability is usually governed by the data transfer mechanism or protocol that delivers data from source to destination. In this paper, we survey and discuss a variety of survivability issues, challenges and mechanisms in multihop wireless networks. Unlike some of the...

Network coding has been shown to be an effective way to achieve the maximum flow capacity of network. In this paper the study performance of network coding using different types of MAC leads to gathering different results and comparing them with respect to performance. The results revealed malfunctioning current of realistic MAC layer .The study showed that this methodology might be the promisi...

We study the asymptotically-achievable rate region of subspace codes for wireless network coding, where receivers have different link capacities due to the access ways or the faults of the intermediate links in the network. Firstly, an outer bound of the achievable rate region in a two-receiver network is derived from a combinatorial method. Subsequently, the achievability of the outer bound is...

Energy consumption has been mostly neglected in network coding (NC) research so far. This work investigates several different properties of NC that influence the energy consumption and thus are important when designing NC systems for batterydriven devices. Different approaches to the necessary implementation of coding operations and Galois fields arithmetic are considered and complexity express...

In this paper, convolutional network coding is formulated by means of matrix power series representation of the local encoding kernel (LEK) matrices and global encoding kernel (GEK) matrices to establish its theoretical fundamentals for practical implementations. From the encoding perspective, the GEKs of a convolutional network code (CNC) are shown to be uniquely determined by its LEK matrix K...

The key issue in determining the lifetime of wireless sensor network (WSN) is the energy burning up of individual node. The cluster based routing improves the energy usage of WSN compared to other routing approach. In this paper, an effective multi-level cluster algorithm using link correlation is proposed for heterogeneous WSN. The level-k hierarchy with single-hop communication between nodes ...

We consider the problem of finding minimum-cost time-varying subgraphs that can deliver continuous service to dynamic multicast groups in coded networks (i.e. networks that use network coding). This problem is relevant for applications such as real-time media distribution. We formulate the problem within the framework of dynamic programming and apply dynamic programming theory to suggest how it...