English
Related papers

Related papers: Cauchy MDS Array Codes With Efficient Decoding Met…

200 papers

Maximum distance separable (MDS) array codes constitute an important class of error-correcting codes due to their optimal distance properties and their relevance in distributed storage systems. In this paper, we investigate the construction…

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

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

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

In this paper we introduce a novel MDS array code with lowest density. In contrast to existing codes, this one has no restrictions on the size or the number of erasures it can correct. It is based on a simple matrix construction involving…

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

Maximum Distance Profile (MDP) convolutional codes are an important class of channel codes due to their maximal delay-constrained error correction capabilities. The design of MDP codes has attracted significant attention from the research…

Information Theory · Computer Science 2025-07-15 Sakshi Dang , Julia Lieb , Okko Makkonen , Pedro Soto , Alex Sprintson

Array codes have been widely employed in storage systems, such as Redundant Arrays of Inexpensive Disks (RAID). The row-diagonal parity (RDP) codes and EVENODD codes are two popular double-parity array codes. As the capacity of hard disks…

Information Theory · Computer Science 2018-03-12 Hanxu Hou , Yunghsiang S. Han , Kenneth W. Shum , Hui Li

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

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

Belief propagation or message passing on binary erasure channels (BEC) is a low complexity decoding algorithm that allows the recovery of message symbols based on bipartite graph prunning process. Recently, array XOR codes have attracted…

Information Theory · Computer Science 2017-09-26 Suayb S. Arslan

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

The Shamir secret sharing scheme requires a Maximum Distance Separable (MDS) code, and in its most common implementation, a Reed-Solomon (RS) code is used. In this paper, we observe that the encoding procedure can be made simpler and faster…

Information Theory · Computer Science 2021-08-16 Allyson Hineman , Mario Blaum

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

In distributed storage systems that use coding, the issue of minimizing the communication required to rebuild a storage node after a failure arises. We consider the problem of repairing an erased node in a distributed storage system that…

Information Theory · Computer Science 2010-09-20 Zhiying Wang , Alexandros G. Dimakis , Jehoshua Bruck

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

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

In order to correct the pair-errors generated during the transmission of modern high-density data storage that the outputs of the channels consist of overlapping pairs of symbols, a new coding scheme named symbol-pair code is proposed. The…

Information Theory · Computer Science 2025-09-17 Xiujing Zheng , Liqi Wang , Shixin Zhu

In this paper, we propose a new method for constructing a class of non-GRS MDS codes. The lengths of these codes can reach up to $\frac{q+3}{2}$ (for finite fields of odd characteristic) and $\frac{q+4}{2}$ (for even characteristic),…

Information Theory · Computer Science 2025-12-03 Guodong Wang , Hongwei Liu , Jinquan Luo

Maximum distance separable (MDS) and near maximum distance separable (NMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes due to their algebraic properties and excellent…

Information Theory · Computer Science 2024-12-16 Yujie Zhi , Shixin Zhu
‹ Prev 1 2 3 10 Next ›