Optimal locally recoverable codes with hierarchy from nested F-adic expansions
From MaRDI portal
Publication:6405628
arXiv2207.10383MaRDI QIDQ6405628FDOQ6405628
Authors: Austin Dukes, Giacomo Micheli, Vincenzo Pallozzi Lavorante 
Publication date: 21 July 2022
Abstract: In this paper we construct new optimal hierarchical locally recoverable codes. Our construction is based on a combination of the ideas of cite{ballentine2019codes,sasidharan2015codes} with an algebraic number theoretical approach that allows to give a finer tuning of the minimum distance of the intermediate code (allowing larger dimension of the final code), and to remove restrictions on the arithmetic properties of compared with the size of the locality sets in the hierarchy. In turn, we manage to obtain codes with a wide set of parameters both for the size of the base field, and for the hierarchy size, while keeping the optimality of the codes we construct.
Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
This page was built for publication: Optimal locally recoverable codes with hierarchy from nested $F$-adic expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6405628)
