Constacyclic locally recoverable codes with locality which equals to its dimension

Zengin R., Köroğlu M. E.

İzmir Matehematics Days V, 27 - 29 Eylül 2023, ss.20

  • Yayın Türü: Bildiri / Özet Bildiri
  • Sayfa Sayıları: ss.20
  • Yıldız Teknik Üniversitesi Adresli: Evet

Özet

Locally recoverable codes (for shortly LRCs) are codes such that a symbol in any coordinate

of a codeword can be recovered by accessing the symbols in at most r other coordinates [1].

They are significant in distributed storage systems and utilized by Microsoft Azure [2] and

Hadoop [3] because they can recover a failed node by accessing the minimum number of the

surviving nodes. Constacyclic codes are very efficient codes due to their encoding and decoding

procedures. In this study, we give two constructions of constacyclic LRCs with locality which

equals to their dimension from their parity-check polynomials.