Showing cs.ITShow all
2 papers · 1 filter
cs.IT2022
Optimal locally recoverable codes with hierarchy from nested -adic expansions
Austin Dukes, Giacomo Micheli, Vincenzo Pallozzi Lavorante
In this paper we construct new optimal hierarchical locally recoverable codes. Our construction is based on a combination of the ideas of \cite{ballentine2019codes,sasidharan2015co…
cs.IT2021
Optimal Selection for Good Polynomials of Degree up to Five
Austin Dukes, Andrea Ferraguti, Giacomo Micheli
Good polynomials are the fundamental objects in the Tamo-Barg constructions of Locally Recoverable Codes (LRC). In this paper we classify all good polynomials up to degree , pro…