Cyclic Codes with Locality and Availability

12/17/2018
by   Lukas Holzbaur, et al.
0

In this work the cyclic locally repairable code (LRC) construction by Tamo et al. is extended to (r,ρ)-locality and availability. We construct codes with a certain minimum distance by carefully extending the defining set of the code. We give a bound on the dimension of LRCs with availability and orthogonal repair sets and show that the given construction is optimal for a range of parameters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/29/2020

New Constructions of Optimal Cyclic (r,δ) Locally Repairable Codes from Their Zeros

An (r, δ)-locally repairable code ((r, δ)-LRC for short) was introduced ...
research
01/19/2021

A family of codes with locality containing optimal codes

Locally recoverable codes were introduced by Gopalan et al. in 2012, and...
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
04/14/2020

Cyclic and convolutional codes with locality

Locally recoverable (LRC) codes and their variants have been extensively...
research
07/21/2022

Optimal locally recoverable codes with hierarchy from nested F-adic expansions

In this paper we construct new optimal hierarchical locally recoverable ...
research
05/31/2018

Optimal cyclic (r,δ) locally repairable codes with unbounded length

Locally repairable codes with locality r (r-LRCs for short) were introdu...
research
07/28/2021

A family of codes with variable locality and availability

In this work we present a class of locally recoverable codes, i.e. codes...

Please sign up or login with your details

Forgot password? Click here to reset