Hierarchically repairable codes and their weight enumerators
Title: Hierarchically repairable codes and their weight enumerators
Speaker: Ragnar Freij-Hollanti (Aalto University, Finland)
Date: Monday, 23rd May 2016
Time: 4pm
Location: Agriculture. 1.01 (Seminar Room).
Abstract:
In this talk, we will survey certain coding-theoretic notions of special importance for distributed storage systems, and how these can be interpreted in terms of matroids. In particular, we consider the notion of local repairability, and generalize it to a hierarchical definition, allowing data items to be recoverable on several different scales. Moreover, we present a family of Singleton-type bounds for such storage codes, and characterize storage codes that are close to meeting these bounds, in terms of field size and weight enumerators.
Series: Algebra
Social Media Links