6 citations · 6 across the 4 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
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…
cs.IT2019
New Lower Bounds for Permutation Codes using Linear Block Codes
Giacomo Micheli, Alessandro Neri
In this paper we prove new lower bounds for the maximal size of permutation codes by connecting the theory of permutation codes with the theory of linear block codes. More specific…
cs.IT2018
Constructions of Locally Recoverable Codes which are Optimal
Giacomo Micheli
Let be a prime power and be the finite field of size . In this paper we provide a Galois theoretical framework that allows to produce good polynomials for the…