New Constructions of Optimal Locally Recoverable Codes via Good Polynomials

DOI10.1109/TIT.2017.2713245MaRDI QIDQ4566671zbMATH OpenOpenAlexFDO

Authors Jian Liu, Sihem Mesnager, Lusheng Chen

Publication date 27 June 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2017.2713245

zbMATH Keywords

constructions of r-good polynomialsoptimal LRC codes

Mathematics Subject Classification ID

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

Cited in

(18)

• Good polynomials for optimal LRC of low locality
• A function field approach toward good polynomials for further results on optimal LRC codes
• Constructions of optimal locally recoverable codes via Dickson polynomials
• On good polynomials over finite fields for optimal locally recoverable codes
• Optimal selection for good polynomials of degree up to five
• Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
• A Family of Optimal Locally Recoverable Codes
• A characterization of optimal locally repairable codes
• New upper bounds and constructions of multi-erasure locally recoverable codes
• On Singleton-type bound of locally repairable codes
• Number theoretical locally recoverable codes
• Optimal (r, )-LRCs from monomial-Cartesian codes and their subfield-subcodes
• Some new constructions of optimal and almost optimal locally repairable codes
• Quantum (r, )-locally recoverable codes
• Good polynomials for locally recoverable codes: classification results, asymptotics, and exact formulae
• A class of locally recoverable codes over finite chain rings
• A family of self-orthogonal divisible codes with locality 2
• Optimal RS-like LRC codes of arbitrary length

This page was built for publication: New Constructions of Optimal Locally Recoverable Codes via Good Polynomials

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