Bounds and optimization for distributed storage

Faculty Member

Iwan Duursma

Coding theory for distributed storage aims to provide solutions for dividing data files over several disks (or nodes in the cloud) such that files can be retrieved efficiently and such that erased data can be recovered efficiently. Solutions necessarily use some form of redundancy in the storage of data and the goal is to minimize this redundancy. We will explore theoretical limits and analyse solutions that approach these limits.

Team Meetings

once per week

Project Difficulty

Intermediate

Undergrad Prerequisites

Knowledge of linear algebra, combinatorics and graph theory is helpful. Some Information theory will be introduced early in the project.