A Unified Form of EVENODD and RDP Codes and Their Efficient Decoding

03/09/2018
by   Hanxu Hou, et al.
0

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 increases, better fault tolerance by using array codes with three or more parity disks is needed. Although many extensions of RDP codes and EVENODD codes have been proposed, the high decoding complexity is the main drawback of them. In this paper, we present a new construction for all families of EVENODD codes and RDP codes, and propose a unified form of them. Under this unified form, RDP codes can be treated as shortened codes of EVENODD codes. Moreover, an efficient decoding algorithm based on an LU factorization of Vandermonde matrix is proposed when the number of continuous surviving parity columns is no less than the number of erased information columns. The new decoding algorithm is faster than the existing algorithms when more than three information columns fail. The proposed efficient decoding algorithm is also applicable to other Vandermonde array codes. Thus the proposed MDS array code is practically very meaningful for storage systems that need higher reliability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/12/2018

Binary MDS Array Codes with Optimal Repair

Consider a binary maximum distance separate (MDS) array code composed of...
research
02/22/2018

A New Design of Binary MDS Array Codes with Asymptotically Weak-Optimal Repair

Binary maximum distance separable (MDS) array codes are a special class ...
research
10/10/2021

A Generalization of Array Codes with Local Properties and Efficient Encoding/Decoding

A maximum distance separable (MDS) array code is composed of m× (k+r) ar...
research
04/13/2021

On Generalized Expanded Blaum-Roth Codes

Expanded Blaum-Roth (EBR) codes consist of n× n arrays such that lines o...
research
12/12/2020

A new framework for building and decoding group codes

This paper investigates the construction and the decoding of a remarkabl...
research
06/29/2021

Generalizing Syndrome Decoding problem to the totally Non-negative Grassmannian

The syndrome decoding problem has been proposed as a computational hardn...
research
12/17/2018

Scalable Block-Wise Product BCH Codes

In this paper we comprehensively investigate block-wise product (BWP) BC...

Please sign up or login with your details

Forgot password? Click here to reset