Maximally recoverable local reconstruction codes from subspace direct sum systems

11/05/2021
by   Shu Liu, et al.
0

Maximally recoverable local reconstruction codes (MR LRCs for short) have received great attention in the last few years. Various constructions have been proposed in literatures. The main focus of this topic is to construct MR LRCs over small fields. An (N=nr,r,h,)-MR LRC is a linear code over finite field _ℓ of length N, whose codeword symbols are partitioned into n local groups each of size r. Each local group can repair any erasure errors and there are further h global parity checks to provide fault tolerance from more global erasure patterns. MR LRCs deployed in practice have a small number of global parities such as h=O(1). In this parameter setting, all previous constructions require the field size ℓ =Ω_h (N^h-1-o(1)). It remains challenging to improve this bound. In this paper, via subspace direct sum systems, we present a construction of MR LRC with the field size ℓ= O(N^h-2+1/h-1-o(1)). In particular, for the most interesting cases where h=2,3, we improve previous constructions by either reducing field size or removing constraints. In addition, we also offer some constructions of MR LRCs for larger global parity h that have field size incomparable with known upper bounds. The main techniques used in this paper is through subspace direct sum systems that we introduce. Interestingly, subspace direct sum systems are actually equivalent to _q-linear codes over extension fields. Based on various constructions of subspace direct sum systems, we are able to construct several classes of MR LRCs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/14/2018

Constructions of maximally recoverable local reconstruction codes via function fields

Local Reconstruction Codes (LRCs) allow for recovery from a small number...
research
12/14/2020

Improved Maximally Recoverable LRCs using Skew Polynomials

An (n,r,h,a,q)-Local Reconstruction Code is a linear code over 𝔽_q of le...
research
12/23/2022

A construction of Maximally Recoverable LRCs for small number of local groups

Maximally Recoverable Local Reconstruction Codes (LRCs) are codes design...
research
10/27/2017

On Maximally Recoverable Local Reconstruction Codes

In recent years the explosion in the volumes of data being stored online...
research
09/28/2018

Universal and Dynamic Locally Repairable Codes with Maximal Recoverability via Sum-Rank Codes

Locally repairable codes (LRCs) are considered with equal or unequal loc...
research
08/14/2018

Two constructions of optimal pairs of linear codes for resisting side channel and fault injection attacks

Direct sum masking (DSM) has been proposed as a counter-measure against ...
research
02/06/2018

Erasure correction of scalar codes in the presence of stragglers

Recent advances in coding for distributed storage systems have reignited...

Please sign up or login with your details

Forgot password? Click here to reset