Locally Recoverable Codes From Automorphism Group of Function Fields of Genus g ≥ 1

A Locally Recoverable Code is a code such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. When we have δ non-overlapping subsets of cardinality ri that can be used to recover the missing coordinate we say that a linear code C with length n, dimension k, minimum distance d has (r
₁
, . . . , r
_δ
)locality and denote by [n, k, d; r
₁
, r
₂
, . . . , r
_δ
]. In this paper we provide a new upper bound for the minimum distance of these codes. Working with a finite number of subgroups of cardinality r
_i
+ 1 of the automorphism group of a function field F|F
_q
of genus g ≥ 1 we propose a construction of [n, k, d; r
₁
, r
₂
, . . . , r
_δ
]-codes and apply the results to some well known families of function fields.