English
Related papers

Related papers: New EVENODD+ Codes with More Flexible Parameters a…

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

Distributed storage systems employ codes to provide resilience to failure of multiple storage disks. Specifically, an $(n, k)$ MDS code stores $k$ symbols in $n$ disks such that the overall system is tolerant to a failure of up to $n-k$…

Information Theory · Computer Science 2013-05-16 Sreechakra Goparaju , Itzhak Tamo , Robert Calderbank

A maximum distance separable (MDS) array code is composed of $m\times (k+r)$ arrays such that any $k$ out of $k+r$ columns suffice to retrieve all the information symbols. Expanded-Blaum-Roth (EBR) codes and Expanded-Independent-Parity…

Information Theory · Computer Science 2022-09-14 Hanxu Hou , Yunghsiang S. Han , Patrick P. C. Lee , You Wu , Guojun Han , Mario Blaum

SD codes are erasure codes that address the mixed failure mode of current RAID systems. Rather than dedicate entire disks to erasure coding, as done in RAID-5, RAID-6 and Reed-Solomon coding, an SD code dedicates entire disks, plus…

Information Theory · Computer Science 2013-05-07 Mario Blaum , James S. Plank

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

In this paper, we consider the update bandwidth in distributed storage systems~(DSSs). The update bandwidth, which measures the transmission efficiency of the update process in DSSs, is defined as the total amount of data symbols…

Information Theory · Computer Science 2020-05-26 Zhengrui Li , Sian-Jheng Lin , Po-Ning Chen , Yunghsiang S. Han , Hanxu Hou

Reed-Solomon (RS) codes are an important class of non-binary error-correction codes. They are particularly competent in correcting burst errors, being widely applied in modern communications and data storage systems. This also thanks to…

Information Theory · Computer Science 2026-02-02 Xiaoqian Ye , Jingyu Lin , Junjie Huang , Li Chen , Chang-An Zhao

This paper describes a non-homogeneous distributed storage systems (DSS), where there is one super node which has a larger storage size and higher reliability and availability than the other storage nodes. We propose three distributed…

Information Theory · Computer Science 2012-08-13 Vo Tam Van , Chau Yuen , Jing Li

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

This paper proposes a novel maximum-likelihood (ML) soft-decision decoding framework for linear block codes, termed error-building decoding (EBD). The complete decoding process can be performed using only the parity-check matrix, without…

Information Theory · Computer Science 2026-01-06 Guoda Qiu , Ling Liu , Yuejun Wei , Liping Li

A construction of Partial Maximum Distance Separable (PMDS) and Sector-Disk (SD) codes extending RAID 5 with two extra parities is given, solving an open problem. Previous constructions relied on computer searches, while our constructions…

Information Theory · Computer Science 2013-05-02 Mario Blaum

This paper presents a novel coding scheme for distributed storage systems containing nodes with adversarial errors. The key challenge in such systems is the propagation of erroneous data from a single corrupted node to the rest of the…

Information Theory · Computer Science 2012-07-17 Natalia Silberstein , Ankit Singh Rawat , Sriram Vishwanath

A linear code with parameters $[n, k, n-k+1]$ is called a maximum distance separable (MDS for short) code. A linear code with parameters $[n, k, n-k]$ is said to be almost maximum distance separable (AMDS for short). A linear code is said…

Information Theory · Computer Science 2023-07-11 Zhonghua Sun , Cunsheng Ding

Large-scale distributed storage systems typically use erasure codes to provide durability of data in the face of failures. A set of $k$ blocks to be stored is encoded using an $[n, k]$ code to generate $n$ blocks that are then stored on…

Information Theory · Computer Science 2019-07-31 Francisco Maturana , K. V. Rashmi

The high repair cost of (n,k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off storage cost for repair bandwidth. In this paper, we address…

Information Theory · Computer Science 2010-04-28 Changho Suh , Kannan Ramchandran

Maximum distance separable (MDS) codes are optimal where the minimum distance cannot be improved for a given length and code size. Twisted Reed-Solomon codes over finite fields were introduced in 2017, which are generalization of…

Information Theory · Computer Science 2020-08-11 Hongwei Liu , Shengwei Liu

Products codes (PCs) are conventionally decoded with efficient iterative bounded-distance decoding (iBDD) based on hard-decision channel outputs which entails a performance loss compared to a soft-decision decoder. Recently, several hybrid…

Information Theory · Computer Science 2022-11-22 Sisi Miao , Lukas Rapp , Laurent Schmalen

Maximum distance separable (MDS) array codes are XOR-based optimal erasure codes that are particularly suitable for use in disk arrays. This paper develops an innovative method to build MDS array codes from an elegant class of nested…

Information Theory · Computer Science 2016-11-18 Nattakan Puttarak , Phisan Kaewprapha , Boon Chong Ng , Jing , Li

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

In this paper we introduce a lowest density MDS array code which is applied to a Smart Meter network to introduce reliability. By treating the network as distributed storage with multiple sources, information can be exchanged between the…

Information Theory · Computer Science 2013-11-07 Magnus Sandell , Filippo Tosato