Optimal constacyclic locally recoverable codes with minimum distance 2 and constacyclic codes with minimum locality

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

7th International Researchers, Statisticians, and Young Statisticians Congress, İstanbul, Türkiye, 2 - 05 Kasım 2023, ss.98

  • Yayın Türü: Bildiri / Özet Bildiri
  • Basıldığı Şehir: İstanbul
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.98
  • Yıldız Teknik Üniversitesi Adresli: Evet

Özet

A locally recoverable code (for brevity LRC) is a code such that a symbol in any coordinate of a codeword can be repaired by using the symbols in at most r other positions. These codes are used in distributed storage systems by Microsoft Azure and Hadoop since they can repair a failed node by accessing the minimum number of the surviving nodes. An LRC which achieves Singleton- type bound is called an optimal LRC. Constacyclic codes are very significant codes because of their efficient encoding and decoding procedures. In this study, we will obtain constacyclic LRCs with minimum locality and optimal constacyclic LRCs with minimum distance 2 from their paritycheck polynomials.