Information flows and information bottlenecks

This is copied from the Centre for Discrete Mathematics page.

Network coding is a relatively new subject, exploiting the fact that the capacity of a network to carry information can be higher than its capacity for regular commodities if the vertices (or edges) of the network have some processing power. The famous “butterfly network”, shown on below, is the simplest example of this paradigm.

The butterfly network

In conjunction with EPSRC (grant EP/H016015/1), we are having a two-day workshop on the topic Information Flows and Information Bottlenecks on 11-12 September 2012. The main aim of the workshop is to communicate problems and challenges in multi-user information theory and Network Coding to a wider community including mathematicians. The first day will consist of tutorials to bring participants up to speed in the area; the second will be a conference at which some of the leading researchers will give presentations.

Information about the workshop will be kept here. We will add further details as they become available.

In the meantime, please email Søren Riis or Peter Cameron if you are interested in attending the workshop.

About Peter Cameron

I count all the things that need to be counted.
This entry was posted in events and tagged . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.