Locally recoverable codes from automorphism group of function fields of genus g ≥ 1

Daniele Bartoli, Maria Montanucci, Luciane Quoos

Research output: Contribution to journalJournal articleResearchpeer-review

14 Downloads (Pure)

Abstract

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 (r1, ..., rδ)- locality and denote by [n, k, d; r1, r2, ..., 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 ri + 1 of the automorphism group of a function field FjFq of genus g ≥ 1 we propose a construction of [n, k, d; r1, r2, ..., rδ]- codes and apply the results to some well known families of function fields.
Original languageEnglish
JournalIEEE Transactions on Information Theory
Volume66
Issue number11
Pages (from-to)6799 - 6808
ISSN0018-9448
DOIs
Publication statusPublished - 2020

Keywords

  • Codes for distributed storage
  • Locally Recoverable Codes
  • Hamming distance
  • Covering maps
  • Maximal curves

Fingerprint Dive into the research topics of 'Locally recoverable codes from automorphism group of function fields of genus g ≥ 1'. Together they form a unique fingerprint.

Cite this