1 research outputs found
Locally recoverable codes from automorphism groups of function fields of genus
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
that can be used to recover the missing coordinate we say that a linear
code with length , dimension , minimum distance has
-locality and denote it by 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
of the automorphism group of a function field of genus , we propose a construction of -codes and apply the results to some well known families
of function fields