On good polynomials over finite fields for optimal locally recoverable codes

DOI10.1007/978-3-030-16458-4_15zbMATH Open1465.94114OpenAlexW2938278940MaRDI QIDQ2327190

Sihem Mesnager

Publication date: 14 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-16458-4_15

zbMATH Keywords

finite fieldscoding theorylocally recoverable codesgood polynomials

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (3)

On some classes of optimal and near-optimal polynomial codes. ⋮ Good polynomials for optimal LRC of low locality ⋮ Optimal RS-like LRC codes of arbitrary length

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A function field approach toward good polynomials for further results on optimal LRC codes 👍 👎
• Constructions of optimal locally recoverable codes via Dickson polynomials 👍 👎
• New Constructions of Optimal Locally Recoverable Codes via Good Polynomials 👍 👎
• Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields 👍 👎
• Constructions of Locally Recoverable Codes Which are Optimal 👍 👎
• Locally Recoverable Codes on Algebraic Curves 👍 👎
• A construction of optimal locally recoverable codes 👍 👎

This page was built for publication: On good polynomials over finite fields for optimal locally recoverable codes

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