As more and more data moves to the cloud, there is an acute need for efficient, fault-tolerant schemes for data storage. Coding theory offers solutions for fault-tolerant storage that are potentially far more efficient than replication. At the same time, the cloud setting presents some novel challenges that the classical theory does not handle.

There are currently two distinct flavors of erasure coding schemes that address this challenge. Regenerating codes attempt to minimize the total amount of data communicated over the network in order to recreate lost data, whereas locally repairable codes (LRCs) attempt to minimize the number of reads required from other machines. Both lines of work lead to new questions about classical objects such as MDS codes.

This tutorial will be in two parts, each focusing on one of the above two lines of work. The first two lectures, given by Parikshit Gopalan, will be on locally repairable codes; the second two lectures, given by Alex Dimakis, will be on regenerating codes. Both speakers will survey the rapid recent developments in this area and the theoretical and practical challenges that lie ahead.

The first session of this talk will take place on Tuesday, January 13 from 11:00 am – 12:00 pm; the third session of this talk will take place on Thursday, January 15 from 11:00 am – 12:00 pm; the fourth session of this talk will take place on Friday, January 16 from 11:00 am – 12:00 pm.