English
Related papers

Related papers: PMDS Array Codes With Small Sub-packetization, Sma…

200 papers

Maximum distance separable (MDS) codes are widely used in distributed storage systems as they provide optimal fault tolerance for a given amount of storage overhead. The seminal work of Dimakis~\emph{et al.} first established a lower bound…

Information Theory · Computer Science 2026-03-24 Zihao Zhang , Guodong Li , Sihuang Hu

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

Partial-MDS (PMDS) codes are a family of locally repairable codes, mainly used for distributed storage. They are defined to be able to correct any pattern of $s$ additional erasures, after a given number of erasures per locality group have…

Information Theory · Computer Science 2017-07-05 Anna-Lena Horlemann-Trautmann , Alessandro Neri

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 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

Maximum distance separable (MDS) codes are optimal error-correcting codes in the sense that they provide the maximum failure-tolerance for a given number of parity nodes. Suppose that an MDS code with $k$ information nodes and $r=n-k$…

Information Theory · Computer Science 2016-04-11 Min Ye , Alexander Barg

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

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

Abundant high-rate (n, k) minimum storage regenerating (MSR) codes have been reported in the literature. However, most of them require contacting all the surviving nodes during a node repair process, resulting in a repair degree of d=n-1.…

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

Maximum-distance-separable (MDS) codes are a class of erasure codes that are widely adopted to enhance the reliability of distributed storage systems (DSS). In (n, k) MDS coded DSS, the original data are stored into n distributed nodes in…

Information Theory · Computer Science 2017-06-16 Sheng Guan , Haibin Kan , Xin Wang

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

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

Information Theory · Computer Science 2020-05-11 Lukas Holzbaur , Sven Puchinger , Eitan Yaakobi , Antonia Wachter-Zeh

MDS (maximum distance separable) array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures. An MDS code with r redundancy nodes can correct any r erasures by accessing (reading)…

Information Theory · Computer Science 2011-07-11 Zhiying Wang , Itzhak Tamo , Jehoshua Bruck

A $(k+r,k,l)$ binary array code of length $k+r$, dimension $k$, and sub-packetization $l$ is composed of $l\times(k+r)$ matrices over $\mathbb{F}_2$, with every column of the matrix stored on a separate node in the distributed storage…

Information Theory · Computer Science 2025-11-13 Lan Ma , Qifu Tyler Sun , Shaoteng Liu , Liyang Zhou

Partial MDS (PMDS) codes are erasure codes combining local (row) correction with global additional correction of entries, while Sector-Disk (SD) codes are erasure codes that address the mixed failure mode of current RAID systems. It has…

Information Theory · Computer Science 2014-01-21 Mario Blaum , James S. Plank , Moshe Schwartz , Eitan Yaakobi

In the literature, all the known high-rate MDS codes with the optimal repair bandwidth possess a significantly large sub-packetization level, which may prevent the codes to be implemented in practical systems. To build MDS codes with small…

Information Theory · Computer Science 2020-11-24 Jie Li , Yi Liu , Xiaohu Tang

MDS array codes are widely used in storage systems to protect data against erasures. We address the \emph{rebuilding ratio} problem, namely, in the case of erasures, what is the the fraction of the remaining information that needs to be…

Information Theory · Computer Science 2011-03-22 Itzhak Tamo , Zhiying Wang , Jehoshua Bruck

For high-rate linear systematic maximum distance separable (MDS) codes, most early constructions could initially optimally repair all the systematic nodes but not all the parity nodes. Fortunately, this issue was first solved by Li et al.…

Information Theory · Computer Science 2021-11-09 Jie Li , Xiaohu Tang , Camilla Hollanti

Maximum distance separable (MDS) codes facilitate the achievement of elevated levels of fault tolerance in storage systems while incurring minimal redundancy overhead. Reed-Solomon (RS) codes are typical MDS codes with the sub-packetization…

Information Theory · Computer Science 2024-05-07 Hao Shi , Zhengyi Jiang , Zhongyi Huang , Bo Bai , Gong Zhang , Hanxu Hou

Minimum storage regenerating (MSR) codes are a class of maximum distance separable (MDS) array codes capable of repairing any single failed node by downloading the minimum amount of information from each of the helper nodes. However, MSR…

Information Theory · Computer Science 2024-08-30 Vinayak Ramkumar , Netanel Raviv , Itzhak Tamo
‹ Prev 1 2 3 10 Next ›