European Companies Search Engine

UK funding (£343,705): Information flows and Information bottlenecks in Network Coding Ukri1 Apr 2010 UK Research and Innovation, United Kingdom

Overview

Text

Information flows and Information bottlenecks in Network Coding

Abstract Transport of information is fundamentally different from transport of traditional commodities, since information can be copied and transformed during transmission while ordinary commodities cannot. The main challenge is to develop results and techniques for handling digital information. The main technical challenge and motivation is to use the insights and results in Network Coding to attack the matrix transposition problem as well as Valiant's shift problem which are both long standing open questions in circuit complexity theory.The purpose of the proposal is to investigate how information can most efficiently be transmitted through various types of communication networks. The project will use recent computer generated results in Information theory to identify and reason about information bottlenecks. The main motivation for the work is to understand information flows and information bottlenecks in a context that is relevant to long standing open questions in (Circuit) Complexity Theory. The project also aims at bridging the gab between these theoretical questions and potential applications of Network Coding.
Category Research Grant
Reference EP/H016015/1
Status Closed
Funded period start 01/04/2010
Funded period end 30/09/2012
Funded value £343,705.00
Source https://gtr.ukri.org/projects?ref=EP%2FH016015%2F1

Participating Organisations

Queen Mary University of London

The filing refers to a past date, and does not necessarily reflect the current state. The current state is available on the following page: Queen Mary University of London, London.

Creative Commons License The visualizations for "Queen Mary University of London - UK funding (£343,705): Information flows and Information bottlenecks in Network Coding" are provided by North Data and may be reused under the terms of the Creative Commons CC-BY license.