arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.01344cs.ITmath.IT
收藏

分布式存储代码

Codes for Distributed Storage

Vinayak Ramkumar, Myna Vajha, S. B. Balaji, M. Nikhil Krishnan, Birenjith Sasidharan, P. Vijay Kumar

摘要:

本章讨论的主题是设计可靠和有效的代码,用于在容易发生故障的存储设备上存储和检索大量数据。长期以来,传统的目标一直是确保可靠性,防止数据丢失,同时最大限度地减少存储开销。最近,出现了第三个问题,即需要有效地从单个存储单元的故障中恢复,对应于从单个代码符号的擦除中恢复。我们在这里解释,编码理论是如何发展的,以应对这一新的挑战。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑