On good polynomials over finite fields for optimal locally recoverable codes - Télécom Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

On good polynomials over finite fields for optimal locally recoverable codes

Résumé

[This is an extended abstract of the paper [3]] A locally recoverable (LRC) code is a code that enables a simple recovery of an erased symbol by accessing only a small number of other symbols. LRC codes currently form one of the rapidly developing topics in coding theory because of their applications in distributed and cloud storage systems. In 2014, Tamo and Barg have presented in a very remarkable paper a family of LRC codes that attain the maximum possible (minimum) distance (given code length, cardinality, and locality). The key ingredient for constructing such optimal linear LRC codes is the so-called r-good polynomials, where r is equal to the locality of the LRC code. In this extended abstract, we review and discuss good polynomials over finite fields for constructing optimal LRC codes.
Fichier non déposé

Dates et versions

hal-03035612 , version 1 (02-12-2020)

Identifiants

Citer

Sihem Mesnager. On good polynomials over finite fields for optimal locally recoverable codes. International Conference on Codes, Cryptology and Information Security (C2SI 2019), Apr 2019, Rabat, Morocco. pp.257-268, ⟨10.1007/978-3-030-16458-4_15⟩. ⟨hal-03035612⟩
46 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More