Constructions of optimal locally recoverable codes via Dickson polynomials

DOI10.1007/S10623-020-00731-0zbMATH Open1465.94112OpenAlexW3005745831MaRDI QIDQ2200512FDOQ2200512

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

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

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)

Cites Work

• On the Locality of Codeword Symbols
• Locally Repairable Codes
• A Family of Optimal Locally Recoverable Codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds on the Parameters of Locally Recoverable Codes
• Constructions of Locally Recoverable Codes Which are Optimal
• Value sets of Dickson polynomials over finite fields
• New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
• 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
• Anticode-based locally repairable codes with high availability
• Bounds on the Size of Locally Recoverable Codes
• New Bounds and Generalizations of Locally Recoverable Codes With Availability

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
• Locally maximal recoverable codes and LMR-LCD codes
• A function field approach toward good polynomials for further results on optimal LRC 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)