Random Network Coding and Designs over GF(q)


logo_network_codingRandom network coding is a recently established powerful scheme for information transmission in a network, which allows nearly optimal throughput. It has opened a major research area in information technology with widespread applications for communication networks like the Internet, wireless communication systems, and cloud computing. However, plain random network coding is very susceptible to packet transmission errors caused by noise or intentional jamming, and thus error-control techniques are of paramount importance.

This COST Action focuses on a new striking approach to random network coding based on award-winning work by R. Koetter and F. Kschischang, in which the network is viewed as a mechanism of delivering not packets but rather the subspace that these packets span, thus leading to a new kind of coding theory employing subspace codes. As in traditional algebraic coding theory, two main research directions in random network coding are
existence and construction of good and optimal network codes, efficient encoding and decoding schemes for a given network code.

Restriction to the so-called Grassmannian codes has proven to be advantageous and leads to the theory of designs over GF(q).

Worldwide, there exists a larger number of workgroups focusing on this topic, which includes several groups located in Europe. This COST Action will set up a European research network and establish network coding as a European core area in communication technology. Its aim is to bring together experts from pure and applied mathematics, computer science, and electrical engineering, who are working in the areas of discrete mathematics, coding theory, information theory, and related fields.