Talks
Spring 2015

Codes for Distributed Storage: Recent Results
Wednesday, Feb. 11, 2015 9:30 am – 10:00 am PST
Location:
Calvin Lab Auditorium
In this two-part talk, we will show first that the notion of locality in codes has a very natural extension to codes with hierarchical locality. We provide a bound on the minimum distance of such codes as well as two general constructions that achieve this bound. The second part of the talk will describe a recent construction of an MSR regenerating code with polynomial sub-packetization level. This is joint work with Birenjith Sasidharan and Gaurav Agarwal.
Attachment | Size |
---|---|
![]() | 993.05 KB |