论文标题
分布式存储的代码
Codes for Distributed Storage
论文作者
论文摘要
本章讨论了设计可靠，有效的代码，以在容易失败的存储设备上存储和检索大量数据。长期以来，传统目标一直是确保对数据丢失的可靠性，同时最大程度地减少存储开销。最近，第三个问题浮出水面，即需要从单个存储单元的故障中有效恢复，这对应于从单个代码符号的擦除中恢复。我们在这里解释，编码理论如何发展以应对这一新挑战。
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.
