Codes with Combined Locality and Regeneration Having Optimal Rate, d_min and Linear Field Size

04/02/2018
by   M. Nikhil Krishnan, et al.
0

In this paper, we study vector codes with all-symbol locality, where the local code is either a Minimum Bandwidth Regenerating (MBR) code or a Minimum Storage Regenerating (MSR) code. In the first part, we present vector codes with all-symbol MBR locality, for all parameters, that have both optimal minimum-distance and optimal rate. These codes combine ideas from two popular codes in the distributed storage literature, Product-Matrix codes and Tamo-Barg codes. In the second part which deals with codes having all-symbol MSR locality, we follow a Pairwise Coupling Transform-based approach to arrive at optimal minimum-distance and optimal rate, for a range of parameters. All the code constructions presented in this paper have a low field-size that grows linearly with the code-length n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/16/2023

New bounds for b-Symbol Distances of Matrix Product Codes

Matrix product codes are generalizations of some well-known construction...
research
10/09/2018

Explicit optimal-length locally repairable codes of distance 5

Locally repairable codes (LRCs) have received significant recent attenti...
research
12/20/2020

Recursive methods for some problems in coding and random permutations

In this paper, we study three applications of recursion to problems in c...
research
06/12/2018

Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions

This thesis makes several significant contributions to the theory of bot...
research
05/24/2021

Constructions of Binary Optimal Locally Repairable Codes via Intersection Subspaces

Locally repairable codes (LRCs), which can recover any symbol of a codew...
research
01/21/2018

A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length

An erasure code is said to be a code with sequential recovery with param...
research
10/04/2021

Sequences of linear codes where the rate times distance grows rapidly

For a linear code C of length n with dimension k and minimum distance d,...

Please sign up or login with your details

Forgot password? Click here to reset