Minimum Distance and Parameter Ranges of Locally Recoverable Codes with Availability from Fiber Products of Curves

04/07/2022
by   María Chara, et al.
0

We construct families of locally recoverable codes with availability t≥ 2 using fiber products of curves, determine the exact minimum distance of many families, and prove a general theorem for minimum distance of such codes. The paper concludes with an exploration of parameters of codes from these families and the fiber product construction more generally. We show that fiber product codes can achieve arbitrarily large rate and arbitrarily small relative defect, and compare to known bounds and important constructions from the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2021

Three New Infinite Families of Optimal Locally Repairable Codes from Matrix-Product Codes

Locally repairable codes have become a key instrument in large-scale dis...
research
06/11/2020

Codes with locality from cyclic extensions of Deligne-Lusztig curves

Recently, Skabelund defined new maximal curves which are cyclic extensio...
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
02/01/2021

The minimum linear locality of linear codes

Locally recoverable codes (LRCs) were proposed for the recovery of data ...
research
03/13/2019

Squares of Matrix-product Codes

The component-wise or Schur product C*C' of two linear error correcting ...
research
10/05/2022

Statistical characterization of the chordal product determinant of Grassmannian codes

We consider the chordal product determinant, a measure of the distance b...
research
07/11/2018

On nested code pairs from the Hermitian curve

Nested code pairs play a crucial role in the construction of ramp secret...

Please sign up or login with your details

Forgot password? Click here to reset