Skip to Main content Skip to Navigation
Conference papers

Constructions of optimal locally recoverable codes via Dickson polynomials

Sihem Mesnager 1, 2, 3, 4 J. Liu D. Tang 
1 UP8 - Université Paris 8 Vincennes-Saint-Denis
2 MC2 - Mathématiques discrètes, Codage et Cryptographie
LTCI - Laboratoire Traitement et Communication de l'Information
3 INFRES - Département Informatique et Réseaux
4 IP Paris - Institut Polytechnique de Paris
Document type :
Conference papers
Complete list of metadata
https://hal.telecom-paris.fr/hal-03035635
Contributor : Olivier Hudry Connect in order to contact the contributor
Submitted on : Wednesday, December 2, 2020 - 11:59:26 AM
Last modification on : Monday, January 24, 2022 - 8:26:28 AM

Identifiers

  • HAL Id : hal-03035635, version 1

Collections

INSTITUT-TELECOM | UNIV-PARIS8 | INSMI | PARISTECH | UNIV-PARIS-SACLAY | LTCI | INFRES | IP_PARIS | UNIV-PARIS-LUMIERES | C2

Citation

Sihem Mesnager, J. Liu, D. Tang. Constructions of optimal locally recoverable codes via Dickson polynomials. Eleventh International Workshop on Coding and Cryptography (WCC 2019), 2019, Saint-Malo, France. ⟨hal-03035635⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

23