New Constructions of Optimal Locally Recoverable Codes via Good Polynomials

DOI10.1109/TIT.2017.2713245zbMath1390.94939OpenAlexW2623918255MaRDI QIDQ4566671

Lusheng Chen, Sihem Mesnager, Jian Liu

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

optimal LRC codesconstructions of r-good polynomials

Mathematics Subject Classification ID

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

Related Items (7)

A function field approach toward good polynomials for further results on optimal LRC codes ⋮ Optimal selection for good polynomials of degree up to five ⋮ A characterization of optimal locally repairable codes ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ Constructions of optimal locally recoverable codes via Dickson polynomials ⋮ Good polynomials for optimal LRC of low locality ⋮ Optimal RS-like LRC codes of arbitrary length

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