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

by   Hanxu Hou, et al.

A maximum distance separable (MDS) array code is composed of m× (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 (EIP) codes are two classes of MDS array codes that can repair any one symbol in a column by locally accessing some other symbols within the column, where the number of symbols m in a column is a prime number. By generalizing the constructions of EBR and EIP codes, we propose new MDS array codes, such that any one symbol can be locally recovered and the number of symbols in a column can be not only a prime number but also a power of an odd prime number. Also, we present an efficient encoding/decoding method for the proposed generalized EBR (GEBR) and generalized EIP (GEIP) codes based on the LU factorization of a Vandermonde matrix. We show that the proposed decoding method has less computational complexity than existing methods. Furthermore, we show that the proposed GEBR codes have both a larger minimum symbol distance and a larger recovery ability of erased lines for some parameters when compared to EBR codes. We show that EBR codes can recover any r erased lines of a slope for any parameter r, which was an open problem in [2].



There are no comments yet.


page 1

page 2

page 3

page 4


On Generalized Expanded Blaum-Roth Codes

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

On the Modulus in Matching Vector Codes

A k-query locally decodable code (LDC) C allows one to encode any n-symb...

Array Codes with Local Properties

In general, array codes consist of m× n arrays and in many cases, the ar...

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

Array codes have been widely employed in storage systems, such as Redund...

Binary MDS Array Codes with Optimal Repair

Consider a binary maximum distance separate (MDS) array code composed of...

An efficient implementation of the Shamir secret sharing scheme

The Shamir secret sharing scheme requires a Maximum Distance Separable (...

Minimizing the alphabet size of erasure codes with restricted decoding sets

A Maximum Distance Separable code over an alphabet F is defined via an e...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.