Constructions of optimal locally recoverable codes via Dickson polynomials

DOI10.1007/S10623-020-00731-0MaRDI QIDQ2200512zbMATH OpenOpenAlexFDO

Authors Jian Liu, Sihem Mesnager, Deng Tang

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

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

Recommendations

• On good polynomials over finite fields for optimal locally recoverable codes
• Good polynomials for optimal LRC of low locality
• A function field approach toward good polynomials for further results on optimal LRC codes
• Optimal RS-like LRC codes of arbitrary length
• Optimal selection for good polynomials of degree up to five

Cites work

• scientific article; zbMATH DE number 732318 (Why is no real title available?)
• scientific article; zbMATH DE number 3443743 (Why is no real title available?)
• A Family of Optimal Locally Recoverable Codes
• Anticode-based locally repairable codes with high availability
• Bounds on the Parameters of Locally Recoverable Codes
• Bounds on the size of locally recoverable codes
• Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
• Constructions of Locally Recoverable Codes Which are Optimal
• Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes
• Locally Repairable Codes
• New Bounds and Generalizations of Locally Recoverable Codes With Availability
• New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
• On the Locality of Codeword Symbols
• Value sets of Dickson polynomials over finite fields

Cited in

(12)

• On good polynomials over finite fields for optimal locally recoverable codes
• The minimum locality of linear codes
• New constructions of optimal \((r, \delta)\)-LRCs via good polynomials
• Optimal \((r,\delta )\)-LRCs from monomial-Cartesian codes and their subfield-subcodes
• Good polynomials for optimal LRC of low locality
• A function field approach toward good polynomials for further results on optimal LRC codes
• Locally maximal recoverable codes and LMR-LCD codes
• Optimal selection for good polynomials of degree up to five
• Some new constructions of optimal and almost optimal locally repairable codes
• A Family of Optimal Locally Recoverable Codes
• Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
• Constacyclic locally recoverable codes from their duals

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200512)