Plenary talk:

Indistinguishability Theory.
Speaker: Ueli Maurer
Speakers: The indistinguishability of discrete interactive systems is a crucial concept in cryptography and information theory. In this talk, targeted at a general information theory audience, we give an overview of several elements of a general theory of discrete systems and their indistinguishability and discuss applications to security proofs and security amplification.

Tutorials:

Algorithmic complexity of network coding.
Speakers: Alex Sprintson, Michael Langberg
Abstract: Given a network G, a set of capacity constraints, and a set of communication requirements, how hard is it to find a network code (if such exists) that satisfies these requirements? How can we construct efficient network codes (e.g., over small alphabets)? How can we efficiently allocate resources in coding networks? This tutorial will address these questions in detail and present the current state of the art, open problems, and promising research directions.
If the first part of the tutorial we present an overview of the best known algorithms for network code construction, resource allocation in coding networks, and reduction of the computational load of network nodes. This part will focus primarily on multicast connections.
In the second part, we discuss the computational complexity of the general network coding problem, focusing on non-multicast scenarios. Specifically, we study the problem of characterizing the rate regions of general network coding instances. Here not much is known. Namely, for linear codes and “low” dimensional vector linear codes, this problem is NP-Hard. However, for more general coding schemes, no such hardness results are known and the complexity of deciding if a given rate vector lies in the capacity region is completely open. We will present recent results in this intriguing research area that touch both combinatorial graph theory and the study of entropic functions.



Network coding security.
Speakers: Tracey Ho, Sid Jaggi
Abstract: Network coded systems present new challenges as well as new possibilities for network security. This tutorial will provide an overview of research directions and results in network coding security. Most existing work falls into two problem domains: secrecy against eavesdroppers that can observe some subset of links/packets, and detection/correction of errors introduced by adversaries that can arbitrarily corrupt some subset of links/packets. We will discuss capacity bounds and code constructions for information theoretic security, as well as schemes based on cryptographic techniques designed for use with network coding. For the network error correction problem, we will discuss both the coherent case where the network coding transfer matrices are known, as well as the noncoherent case where the transfer matrices are not known.

Program Timeline

Monday June 15:

8:00-10:00	Tutorial: Network coding security.
10:00 - 10:30	Break
10:30 - 12:30	Tutorial: Algorithmic complexity of network coding.
12:30 - 2:00	Lunch
2:00 - 3:00	Session I
3:00 - 3:20	Break
3:20 - 4:20	Session II
4:30 - 6:00	Poster Session

Tuesday June 16:

9:00 - 10:20	Session III
10:20 - 10:40	Break
10:40 - 11:40	Session IV
11:40 - 1:20	Lunch
1:20 - 2:20	Plenary
2:30 - 3:30	Session V
3:30 - 3:50	Break
3:50 - 5:10	Session VI

Presented Talks

Session I (Monday, 2:00-3:00pm)

• Secure error-correcting (SEC) network codes

Chi-Kin Ngai, Raymond W. Yeung

• On error control codes for random network coding

R. Ahlswede, Harout Aydinian

• Network generalized Hamming weight

Chi Kin Ngai, Raymond W. Yeung, Zhixue Zhang

Session II: (Monday, 3:20-4:20pm)

• On the limiting behavior of random linear network codes

Huseyin Balli , Zhen Zhang

• Network coding theory via commutative algebra

Shuoyen Robert Li, Qifu Tyler Sun

• Sparse network coding with overlapping classes

Danilo Silva, Weifei Zeng, Frank R. Kschischang

Session III: (Tuesday, 9:00-10:20 am)

• On coding in mobile wireless networks

Emina Soljanin

• Adaptive network coding for broadcast channels

Parastoo Sadeghi, Danail Traskov, Ralf Koetter

• Broadcast erasure channel with feedback - capacity and algorithms

Leonida Georgiadis, Leandros Tassiulas

• Broadcasting in time-division duplexing: A random linear network coding approach

Daniel E. Lucani, Muriel Medard, Milica Stojanovic

Session IV: (Tuesday, 10:40-11:40 pm)

• Pipelined encoding for deterministic and noisy relay networks

Gerhard Kramer

• The price of selfishness in network coding

Jason R. Marden, Michelle Effros

• Energy consumption in coded queues for wireless information exchange

J. Goseling, R.j. Boucherie, J.c.w Van Ommeren

Session V: (Tuesday, 2:30-3:30 pm)

• A feedback-based adaptive broadcast coding scheme for minimizing in-order delivery delay

Jay-Kumar Sundararajan, Parastoo Sadeghi, Muriel Medard

• The conditions to determine convolutional network coding on matrix representation

Ning Cai, Wangmei Guo

• Performance modeling of stochastic networks with network coding

Kui Wu, Weijia Jia, Yuan Yuan, Yuming Jiang

Session VI: (Tuesday, 3:50-5:10 pm)

• The repair problem for erasure coding-based storage: An overview

Yunnan Wu

• Distributed storage allocation problems

Derek Leong, Alexandros G. Dimakis, Tracey Ho

• Some results on communicating the sum of sources over a network

Brijesh Kumar Rai, Bikash Kumar Dey, Abhay Karandikar

• Multiple source multiple destination topology inference using network coding

Pegah Sattari, Athina Markopoulou, Christina Fragouli