Constructions of optimal locally recoverable codes via Dickson polynomials.

J. Liu; Sihem Mesnager; D. Tang

Journal articles

Constructions of optimal locally recoverable codes via Dickson polynomials.

J. Liu Sihem Mesnager ^{1, 2, 3, 4} D. Tang

1 UP8 - Université Paris 8 Vincennes-Saint-Denis

2 INFRES - Département Informatique et Réseaux

3 MC2 - Mathématiques discrètes, Codage et Cryptographie

LTCI - Laboratoire Traitement et Communication de l'Information

4 IP Paris - Institut Polytechnique de Paris

Document type :

Journal articles

Domain :

Mathematics [math]

Complete list of metadata

https://hal.telecom-paris.fr/hal-03053992
Contributor : Olivier Hudry Connect in order to contact the contributor
Submitted on : Friday, December 11, 2020 - 11:41:25 AM
Last modification on : Wednesday, October 27, 2021 - 6:43:19 AM

Constructions of optimal locally recoverable codes via Dickson polynomials.

Identifiers

Collections

Citation

Export

Metrics

34

Constructions of optimal locally recoverable codes via Dickson polynomials.

Identifiers

Collections

Citation

Export

Share

Metrics

34