Program Overview

Jump to other IT Society Websites:

Monday Tuesday Wednesday Thursday Friday
Morning Session I
 (9:00 - 10:30)
Frans Willems  Gerhard Kramer Michael Gastpar  Sennur Ulukus Alex Dimakis 
 Coffee Break
(10:30 - 11:00)
--  -- --  --  -- 
Morning Session II
 (11:00 - 12:30)  
Frans Willems   Gerhard Kramer Michael Gastpar Sennur Ulukus   Alex Dimakis  
(12:30 - 14:00
--  --  --  --  -- 
Afternoon Session I
 (14:00 - 15:30) 
Session I 
Session III
Excursion   Amos Lapidoth School Closes 
Coffee Break
(15:30 - 16:00) 
-- --  Excursion  --   
Afternoon Session II
 (16:00 - 18:00) 
Session II   
Session IV   
Excursion Student
 Session V     

Frans Willems  (Eindhoven University of Technology, Netherlands)
Introduction to Universal Source Coding and Biometrics
Monday, April 16, 9:00 - 12:30
The lecture consists of two parts. The first part focusses on universal source coding, the second part on biometrics. In the first part we consider universal source coding based on waiting times and coding based on weighting over tree models. The waiting-time algorithm hinges on Kacs theorem [1947]. It achieves entropy for stationary ergodic sources and explains the idea underlying the Lempel-Ziv buffer source coding method [1977]. The weighting-method is based on context trees and arithmetic coding. It achieves entropy for tree sources but moreover minimizes the redundancy. The algorithm can also be applied for learning the tree model producing the data that are observed.
In the second part of the lecture we consider biometrics from an information-theoretical perspective. We will consider both authentication and identification protocols, and investigate protected and unprotected databases. The emphasis is on binary biometrics and error exponents.
Gerhard Kramer (Technical University of Munich, Germany)
Network Flow and Network Coding
Tuesday, April 17, 9:00 - 12:30

The lectures treat the basics of network flow via Ford and Fulkerson's flow-augmenting path algorithm and
of linear network coding via Koetter and Medard's linear systems approach. Time-permitting, we show how
the results generalize to classic networks using random network coding, and to general networks, including
wireless networks, using "noisy" or "digital" network coding by viewing network coding as a compress-forward
relaying strategy.
Michael Gastpar (UC Berkeley, USA and EPFL, Switzerland)
Algebraic Structure in Network Information Theory
Wednesday, April 18, 9:00 - 12:30

In information-theoretic theorems, achievability arguments are typically established via the IID random coding argument: codewords are sampled randomly from a judiciously chosen probability distribution. By contrast, algebraic methods are used to develop practical encoding and decoding schemes of reasonable complexity. However, an emerging body of work has demonstrated that algebraic methods also have an important role to play in establishing the fundamental capacity limits of networks. That is, in certain scenarios, structured random coding arguments have been able to achieve rates beyond what is possible using the best known i.i.d. random coding methods. This phenomenon was first noticed in 1979 by Korner and Marton for the distributed compression of the parity of two dependent sources. More recently, several groups have shown that algebraic structure can significantly enhance performance in relay networks, interference channels, distributed source coding, distributed interference cancellation, and physical layer network coding, among others. The aim is to provide an accessible introduction to structured random codes and their applications in network information theory. We will start with random linear codes for discrete memoryless channels and move towards random lattice codes for Gaussian channels. To develop intuition, we will first review how these methods can be used to prove capacity results in classical settings. Afterwards, we will discuss several settings in which the inherent algebraic structure of the code provides some advantages. 

Sennur Ulukus (University of Maryland, USA) 
Information Theoretic Security
Thursday, April 19, 9:00 - 12:30

Information-theoretic physical-layer security has emerged in the past few years as a promising new approach to securing wireless communications. This field explores possibilities of providing security in the physical layer using techniques from information theory, communication theory and signal processing. This approach is a fundamental departure from the currently available cryptographic solutions in that the security it provides is unbreakable, provable and quantifiable (in bits/sec/hertz), and is effective even against computationally-unlimited adversaries. This approach exploits unique characteristics of the wireless medium, such as the inherent random fluctuations in the wireless channel, broadcast nature of wireless communications and overheard information, use of multiple antennas, carefully designed multi-user interactions, e.g., cooperative jamming, feedback, signal alignment, etc. In this lecture, I will cover security of single-user and multi-user wireless communication systems. I will start the lecture with Shannon's secrecy system and the one-time pad. I will introduce Wyner's wiretap channel and Csiszar-Korner's generalization of the wiretap channel. I will present the Gaussian wiretap channel, independent parallel wiretap channels, fading wiretap channel, and the MIMO wiretap channel. I will then talk about multi-user wiretap channels and introduce the multiple-access wiretap channel and cooperative jamming, multi-receiver wiretap channel, broadcast channel with confidential messages, relay channel and cooperative secrecy, and interference channel with confidential messages.

Amos Lapidoth (ETHZ, Switzerland)
Two by Gelfand and Pinsker
Thursday, April 19, 14:00 - 15:30

In 1980 Gel'fand and Pinsker published two influential papers: on the capacity of channels with noncausal side information, and on the capacity of the semi-deterministic broadcast channel. In this talk I shall discuss these two results and present a recent result with Ligong Wang that unifies them. 

Alex Dimakis (University of Southern California, USA) 
Network Coding for Distributed Storage
Friday, April 20, 9:00 - 12:30
Modern cloud storage systems need to provide data reliability despite multiple node failures per day.  As the amount of stored information is increasing, fueled by modern applications like big data analytics and video sharing, the reliability per bit needs to dramatically increase.To solve this problem, storage systems recently started deploying erasure coding techniques to provide high reliability with small storage overheads. We show how network coding techniques can surprisingly make the maintenance of such encoded system more efficient by orders of magnitude compared to standard Reed-Solomon codes. Following recent developments, we show that interference alignment, a technique developed for wireless communications, is fundamental for distributed storage problems. We will present information theoretic performance bounds and achievable schemes based on novel network codes that use interference alignment.
Finally, we will discuss implementation issues over the Hadoop Distributed File system. A working system that uses novel regenerating codes over Hadoop and a comparison to the Reed-Solomon HDFS system currently used in Facebook Data warehouses will be presented. 
Student Presentations:

Session I
Monday, April 16, 14:00 - 15:30

1) Nicolo Michelusi    
Optimal transmission policies for energy harvesting devices
2) Marco Maso  
Channel Estimation Impact for LTE Small Cells based on MU-VFDM
3) Ralph Tanbourgi 
Adaptive Modulation and Coding in Interference-Limited Wireless Ad Hoc Networks
4) Melda Yuksel    
New Achievable Rate Regions for Broadcast Relay Channels: Compression for Two Destinations
5) Christoph Schmitz   
Reachability of the Capacity in Parallel Quantised Channels
6) Julia Vinogradova   
Source detection, power estimation, and localization in large dimensional sensor networks in the presence of unknown correlated noise

Session II
Monday, April 16, 16:00 - 18:00

1) Simon Görtzen   
Discrete Multi-Carrier Resource Allocation
2) Céline Aubel    
Sparse recovery guarantees for signals having morphologically different components
3) Laszlo Czap 
Secret messages over a broadcast channel
4) Siddhartha Brahma   
Index Coding
5) Morteza Varasteh    
Joint Source Channel Coding in the presence of the correlated interference
6) Francisco Lázaro Blasco 
Time Interference Alignment via Delay Offset For Long Delay Networks
7) Iñaki Estella   
Relay channel with correlated noise
8) Andreas Bollig  
Information theoretic models for neuronal communication

Session III
Tuesday, April 17, 14:00 - 15:30

1) Liang Li    
Multiuser diversity in terms of symbol error rate
2) Jonathan Scarlett   
Properties of Random Coding Error Exponents for Mismatched Decoders
3) Reinhard Heckel 
The Generalized Multiple Measurement Vector Problem
4) Jing Guo    
Information combining and polar coding
5) Wei Yang    
Capacity pre-log of SIMO correlated block-fading channels
6) Sabrina Gerbracht   
Secrecy in Relay Networks

Session IV
Tuesday, April 17, 16:00 - 18:00

1) Alla Merzakreeva   
Capacity scaling laws for one-dimensional wireless networks
2) Marc Desgroseilliers    
Degrees of freedom through random matrices
3) David Stotz
Survey on Rényi Information Dimension
4) Nicola di Pietro    
Integer Low-Density Lattices
5) Christian Kissling  
Stability of Contention Resolution Diversity Slotted ALOHA
6) Germán Corrrales Madueño    
Packet Random Access Channel in GSM/GPRS for Machine Type Communications
7) Onur Tan    
Smart Meter Privacy in the Presence of Energy Harvesting and Storage Devices
8) Johannes Richter
Efficient Calculating of Coefficients for Compute-and-forward
Session V
Thursday, April 19, 16:00 - 18:00

1) Solomon Tesfamicael 
Replica symmetric breaking in compressed sensing
2) Sheng Huang 
Coding for Function Computing and Polynomials
3) Kasper Fløe Trillingsgaard  
Wireless Systems with Energy Harvesting and Simple ON-OFF Signaling
4) Maria Gregori   
Efficient Data Transmission strategies for Energy Harvesting Nodes
5) Luca Rose   
Degrees of freedom through random matrices
6) Alex Mueller    
Analysing Interference Mitigation via 3D Beam-forming for CoMP Networks in the Large System Limit
7) Subhash Lakshminaryana  
Cross Layer Optimization for Multi-user MIMO systems
8) Walid Abediseid 
To Space-Time Code or Not: A Low Complexity System Design for The Quasi-Static MIMO Channel