Convertible codes: Adaptive coding for large-scale data storage

Published on ● Video Link: https://www.youtube.com/watch?v=NRrTVw5BF6c



Duration: 50:35
181 views
0


Rashmi Vinayak (Carnegie Mellon University)
https://simons.berkeley.edu/talks/rashmi-vinayak-carnegie-mellon-university-2024-03-05
Application-Driven Coding Theory

Erasure codes are a popular choice for distributed storage systems as they provide protection against failures and unavailabilities with low storage overhead. Two key properties of codes that are of interest in storage systems are (1) the ability to decode a lost code symbol by accessing a small number of other code symbols (local repair) and (2) the ability to modify the parameters of the code over time as the failure rate of disks and popularity of data change (code conversion). Two classes of codes that possess these two properties are Locally repairable codes (LRCs) and Convertible codes, respectively. In this talk, I will introduce a new class of codes that possess both of these properties simultaneously, termed Locally Repairable Convertible Codes.







Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Application-Driven Coding Theory
Rashmi Vinayak