Codes for Distributed Storage
Information Theory
2020-10-06 v1 math.IT
Abstract
This chapter deals with the topic of designing reliable and efficient codes for the storage and retrieval of large quantities of data over storage devices that are prone to failure. For long, the traditional objective has been one of ensuring reliability against data loss while minimizing storage overhead. More recently, a third concern has surfaced, namely of the need to efficiently recover from the failure of a single storage unit, corresponding to recovery from the erasure of a single code symbol. We explain here, how coding theory has evolved to tackle this fresh challenge.
Cite
@article{arxiv.2010.01344,
title = {Codes for Distributed Storage},
author = {Vinayak Ramkumar and Myna Vajha and S. B. Balaji and M. Nikhil Krishnan and Birenjith Sasidharan and P. Vijay Kumar},
journal= {arXiv preprint arXiv:2010.01344},
year = {2020}
}
Comments
This survey article will appear as a chapter in the upcoming "A Concise Encyclopedia of Coding Theory", W. C. Huffman, J.-L. Kim, and P. Sol\'e, CRC Press