Constructions of optimal locally recoverable codes via Dickson polynomials

DOI10.1007/s10623-020-00731-0zbMath1465.94112OpenAlexW3005745831MaRDI QIDQ2200512

Deng Tang, Sihem Mesnager, Jian Liu

Publication date: 22 September 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-020-00731-0

zbMATH Keywords

linear codeDickson polynomiallocally recoverable codepolynomial over a finite field

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Polynomials over finite fields (11T06)

Related Items (5)

A function field approach toward good polynomials for further results on optimal LRC codes ⋮ Optimal selection for good polynomials of degree up to five ⋮ The minimum locality of linear codes ⋮ New constructions of optimal \((r, \delta)\)-LRCs via good polynomials ⋮ Good polynomials for optimal LRC of low locality

Cites Work

• Unnamed Item
• Unnamed Item
• Value sets of Dickson polynomials over finite fields
• Anticode-based locally repairable codes with high availability
• Bounds on the Parameters of Locally Recoverable Codes
• Bounds on the Size of Locally Recoverable Codes
• Locally Repairable Codes
• A Family of Optimal Locally Recoverable Codes
• On the Locality of Codeword Symbols
• New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
• Constructions of Locally Recoverable Codes Which are Optimal
• New Bounds and Generalizations of Locally Recoverable Codes With Availability
• Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes
• Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes

This page was built for publication: Constructions of optimal locally recoverable codes via Dickson polynomials