Constructions of Locally Recoverable Codes Which are Optimal

DOI10.1109/TIT.2019.2939464MaRDI QIDQ5211590zbMATH OpenFDO

Authors Giacomo Micheli

Publication date 28 January 2020

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

Full work available at URL https://arxiv.org/abs/1806.11492

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: Let $q$ be a prime power and $mathbb{F}_q$ be the finite field of size $q$. In this paper we provide a Galois theoretical framework that allows to produce good polynomials for the Tamo and Barg construction of optimal locally recoverable codes (LRC). Using our approach we construct new good polynomials and then optimal LRCs with new parameters. The existing theory of good polynomials fits entirely in our new framework. The key advantage of our method is that we do not need to rely on arithmetic properties of the pair $(q,r)$, where $r$ is the locality of the code.

Cited in

(35)

• Locally recoverable \(J\)-affine variety codes
• 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
• Exceptional scatteredness in prime degree
• On good polynomials over finite fields for optimal locally recoverable codes
• On construction and (non)existence of \(c\)-(almost) perfect nonlinear functions
• Investigating the exceptionality of scattered polynomials
• Optimal selection for good polynomials of degree up to five
• Algebraic constructions of complete \(m\)-arcs
• The minimum locality of linear codes
• Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
• Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves
• A Family of Optimal Locally Recoverable Codes
• Maximally Recoverable Codes for Grid-like Topologies
• Integrated interleaved codes as locally recoverable codes: properties and performance
• A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures
• A characterization of optimal locally repairable codes
• New upper bounds and constructions of multi-erasure locally recoverable codes
• New constructions of optimal \((r, \delta)\)-LRCs via good polynomials
• Constacyclic locally recoverable codes from their duals
• 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
• Towards the classification of exceptional scattered polynomials
• A class of locally recoverable codes over finite chain rings
• Codes from A_m-invariant polynomials
• Two families of optimal quantum locally recoverable codes
• LRCS: duality, LP bounds, and field size
• Optimal quantum (r, )-locally repairable codes via classical ones
• Cyclic (r, ) locally recoverable codes from their constacyclic and negacyclic subcodes
• Optimal rank-metric codes with rank-locality from Drinfeld modules
• Optimal RS-like LRC codes of arbitrary length

This page was built for publication: Constructions of Locally Recoverable Codes Which are Optimal

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