English
Related papers

Related papers: MDS Codes with Progressive Engagement Property for…

200 papers

Maximum-distance separable (MDS) array codes with high rate and an optimal repair property were introduced recently. These codes could be applied in distributed storage systems, where they minimize the communication and disk access required…

Information Theory · Computer Science 2013-02-19 Eyal En Gad , Robert Mateescu , Filip Blagojevic , Cyril Guyot , Zvonimir Bandic

Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundancy but also achieve low computational complexity. They are…

Information Theory · Computer Science 2019-06-24 Hanxu Hou , Yunghsiang Han , Patrick P. C. Lee , Yuchong Hu , Hui Li

In order to scale economically, data centers are increasingly evolving their data storage methods from the use of simple data replication to the use of more powerful erasure codes, which provide the same level of reliability as replication…

Information Theory · Computer Science 2013-11-12 Nihar B. Shah , Kangwook Lee , Kannan Ramchandran

In large-scale distributed storage systems, erasure codes are used to achieve fault tolerance in the face of node failures. Tuning code parameters to observed failure rates has been shown to significantly reduce storage cost. Such tuning of…

Information Theory · Computer Science 2020-06-05 Francisco Maturana , V. S. Chaitanya Mukka , K. V. Rashmi

Maximum distance separable (MDS) codes are widely used in storage systems to protect against disk (node) failures. A node is said to have capacity $l$ over some field $\mathbb{F}$, if it can store that amount of symbols of the field. An…

Information Theory · Computer Science 2016-11-17 Itzhak Tamo , Zhiying Wang , Jehoshua Bruck

Efficient node repair is a central requirement in distributed storage systems, particularly in high-rate erasure-coded deployments where repair traffic directly affects network overhead and recovery cost. Piggybacking codes reduce the…

Information Theory · Computer Science 2026-05-06 Hao Shi , Zhengyi Jiang , Gefeng Deng , Zhongyi Huang , Hanxu Hou

Regenerating codes enable trading off repair bandwidth for storage in distributed storage systems (DSS). Due to their distributed nature, these systems are intrinsically susceptible to attacks, and they may also be subject to multiple…

Information Theory · Computer Science 2014-07-10 O. Ozan Koyluoglu , Ankit Singh Rawat , Sriram Vishwanath

This paper addresses the problem of constructing MDS codes that enable exact repair of each code block with small repair bandwidth, which refers to the total amount of information flow from the remaining code blocks during the repair…

Information Theory · Computer Science 2017-09-26 Ankit Singh Rawat , Itzhak Tamo , Venkatesan Guruswami , Klim Efremenko

In distributed storage systems that employ erasure coding, the issue of minimizing the total {\it communication} required to exactly rebuild a storage node after a failure arises. This repair bandwidth depends on the structure of the…

Information Theory · Computer Science 2011-06-09 Dimitris S. Papailiopoulos , Alexandros G. Dimakis , Viveck R. Cadambe

Regenerating codes are efficient methods for distributed storage in storage networks, where node failures are common. They guarantee low cost data reconstruction and repair through accessing only a predefined number of arbitrarily chosen…

Information Theory · Computer Science 2017-11-09 Kaveh Mahdaviani , Ashish Khisti , Soheil Mohajer

Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure correcting codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD codes with local regeneration where each local code is a…

Information Theory · Computer Science 2021-06-14 Lukas Holzbaur , Sven Puchinger , Eitan Yaakobi , Antonia Wachter-Zeh

This paper presents a construction for high-rate MDS codes that enable bandwidth-efficient repair of a single node. Such MDS codes are also referred to as the minimum storage regenerating (MSR) codes in the distributed storage literature.…

Information Theory · Computer Science 2016-01-26 Ankit Singh Rawat , O. Ozan Koyluoglu , Sriram Vishwanath

Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code with the property of degraded-read friendly (DRF) is…

Information Theory · Computer Science 2021-02-05 Ting-Yi Wu , Yunghsiang S. Han , Zhengrui Li , Bo Bai , Gong Zhang , Liang Chen , Xiang Wu

Distributed storage systems are mainly justified due to the limited amount of storage capacity and improving the reliability through distributing data over multiple storage nodes. On the other hand, it may happen the data is stored in…

Information Theory · Computer Science 2010-04-15 Soroush Akhlaghi , Abbas Kiani , Mohammad Reza Ghanavati

In a distributed storage system based on erasure coding, an important problem is the \emph{repair problem}: If a node storing a coded piece fails, in order to maintain the same level of reliability, we need to create a new encoded piece and…

Information Theory · Computer Science 2016-11-17 Yunnan Wu

High-rate minimum storage regenerating (MSR) codes are known to require a large sub-packetization level, which can make meta-data management difficult and hinder implementation in practical systems. A few maximum distance separable (MDS)…

Information Theory · Computer Science 2023-08-29 Jie Li , Yi Liu , Xiaohu Tang , Yunghsiang S. Han , Bo Bai , Gong Zhang

Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes…

We address the use of maximum distance separable (MDS) codes for distributed storage (DS) to enable efficient content delivery in wireless networks. Content is stored in a number of the mobile devices and can be retrieved from them using…

Information Theory · Computer Science 2016-08-30 Amina Piemontese , Alexandre Graell i Amat

MDS codes are erasure-correcting codes that can correct the maximum number of erasures for a given number of redundancy or parity symbols. If an MDS code has $r$ parities and no more than $r$ erasures occur, then by transmitting all the…

Information Theory · Computer Science 2014-11-25 Zhiying Wang , Itzhak Tamo , Jehoshua Bruck

In large-scale distributed storage systems, erasure coding is employed to ensure reliability against disk failures. Recent work by Kadekodi et al. demonstrates that adapting code parameters to varying disk failure rates can lead to…

Information Theory · Computer Science 2025-08-11 Vinayak Ramkumar , Xiangliang Kong , G. Yeswanth Sai , Myna Vajha , M. Nikhil Krishnan