Giacomo Micheli
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Giacomo Micheli has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Andrea Ferraguti
DICATAM, University of Brescia, via Branze 43, I-25123 Brescia, Italy
8 shared publications - Violetta Weger
Technical University of Munich Germany
6 shared publications - Reto Schnyder
University of Zürich
4 shared publications - Vincenzo Pallozzi Lavorante
Department of Mathematics and Statistics, University of South Florida, Tampa, FL, USA
4 shared publications - Daniele Bartoli
Department of Mathematics and Informatics, University of Perugia, Perugia, Italy
3 shared publications - Federico Amadio Guidi
Mathematical Institute, University of Oxford, Oxford, UK
3 shared publications
Latest Publications
- 24 June 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 10 (2) , 467-489
Optimal Rank-Metric Codes with Rank-Locality from Drinfeld Modules
We introduce a new technique to construct rank-metric codes using the arithmetic theory of Drinfeld modules and the Dirichlet theorem on polynomial arithmetic progressions. Using our methods, we obtain a new infinite family of optimal rank-metric codes with rank-locality; i.e., every code in our family achieves the information theoretical bound for rank-metric codes with rank-locality.
- 24 June 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 10 (2) , 467-489
Optimal Rank-Metric Codes with Rank-Locality from Drinfeld Modules
We introduce a new technique to construct rank-metric codes using the arithmetic theory of Drinfeld modules and the Dirichlet theorem on polynomial arithmetic progressions. Using our methods, we obtain a new infinite family of optimal rank-metric codes with rank-locality; i.e., every code in our family achieves the information theoretical bound for rank-metric codes with rank-locality.
- Open Access
On the Characteristic Polynomial of Linearized Polynomials
Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large extension field $\mathbb F_{q^n}\supseteq k$. Our algorithm has computational complexity of $O(n(\log(n))^4)$ in terms of $\mathbb F_q$ operations with the implied constant depending only on $k$ and $r$. Up to logarithmic factors, and for linear maps represented by low degree polynomials, this provides a square root improvement over generic algorithms.Open AccessOn the Characteristic Polynomial of Linearized Polynomials
Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large extension field $\mathbb F_{q^n}\supseteq k$. Our algorithm has computational complexity of $O(n(\log(n))^4)$ in terms of $\mathbb F_q$ operations with the implied constant depending only on $k$ and $r$. Up to logarithmic factors, and for linear maps represented by low degree polynomials, this provides a square root improvement over generic algorithms. - 18 April 2025
- Published by Springer Nature in La Matematica
- Vol. 4 (2) , 459-485
The Code Equivalence Problem and Its Applications to Cryptography
- 18 April 2025
- Published by Springer Nature in La Matematica
- Vol. 4 (2) , 459-485
The Code Equivalence Problem and Its Applications to Cryptography
- 5 April 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (8) , 2931-2945
Constructions of locally recoverable codes with large availability
- 5 April 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (8) , 2931-2945
Constructions of locally recoverable codes with large availability
- 25 March 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 24 (13n14)
Good polynomials for locally recoverable codes: Classification results, asymptotics, and exact formulae
Let [ ] be a prime power and [ ]. In this paper we complete the classification of good polynomials of degree [ ] that achieve the best possible asymptotics (with an explicit error term) for the number of totally split places. Moreover, for degrees up to [ ], we provide an explicit lower bound and an asymptotic estimate for the number of totally split places of [ ]. Finally, we prove the general fact that the number [ ] of [ ] for which [ ] splits obeys a linear recurring sequence. For any [ ], this allows for the computation of [ ] for large [ ] by only computing a recurrence sequence over [ ].
- 25 March 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 24 (13n14)
Good polynomials for locally recoverable codes: Classification results, asymptotics, and exact formulae
Let [ ] be a prime power and [ ]. In this paper we complete the classification of good polynomials of degree [ ] that achieve the best possible asymptotics (with an explicit error term) for the number of totally split places. Moreover, for degrees up to [ ], we provide an explicit lower bound and an asymptotic estimate for the number of totally split places of [ ]. Finally, we prove the general fact that the number [ ] of [ ] for which [ ] splits obeys a linear recurring sequence. For any [ ], this allows for the computation of [ ] for large [ ] by only computing a recurrence sequence over [ ].
- 28 February 2025
- Published by Springer Nature
- p. 191-212
Differential Biases, c-Differential Uniformity, and Their Relation to Differential Attacks
- 28 February 2025
- Published by Springer Nature
- p. 191-212
Differential Biases, c-Differential Uniformity, and Their Relation to Differential Attacks
- 27 December 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (6) , 1597-1609
Codes from $A_m$-invariant polynomials- 27 December 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (6) , 1597-1609
Codes from $A_m$-invariant polynomials- Open Access
Codes from $A_m$-invariant polynomials
Let $q$ be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on $\mathbb F_q[x_1,\dots,x_m]$ combined with the ideas in (M. Datta and T. Johnsen, 2022). Compared with Generalized Reed-Muller codes with similar parameters, our codes have the same asymptotic relative distance but a better rate. Our results follow from combinations of Galois theoretical methods with Weil-type bounds for the number of points of hypersurfaces over finite fields.Open AccessCodes from $A_m$-invariant polynomials
Let $q$ be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on $\mathbb F_q[x_1,\dots,x_m]$ combined with the ideas in (M. Datta and T. Johnsen, 2022). Compared with Generalized Reed-Muller codes with similar parameters, our codes have the same asymptotic relative distance but a better rate. Our results follow from combinations of Galois theoretical methods with Weil-type bounds for the number of points of hypersurfaces over finite fields. - Open Access
Square patterns in dynamical orbits
Let $q$ be an odd prime power. Let $f\in \mathbb{F}_q[x]$ be a polynomial having degree at least $2$, $a\in \mathbb{F}_q$, and denote by $f^n$ the $n$-th iteration of $f$. Let $χ$ be the quadratic character of $\mathbb{F}_q$, and $\mathcal{O}_f(a)$ the forward orbit of $a$ under iteration by $f$. Suppose that the sequence $(χ(f^n(a)))_{n\geq 1}$ is periodic, and $m$ is its period. Assuming a mild and generic condition on $f$, we show that, up to a constant, $m$ can be bounded from below by $|\mathcal{O}_f(a)|/q^\frac{2\log_{2}(d)+1}{2\log_2(d)+2}$. More informally, we prove that the period of the appearance of squares in an orbit of an element provides an upper bound for the size of the orbit itself. Using a similar method, we can also prove that, up to a constant, we cannot have more than $q^\frac{2\log_2(d)+1}{2\log_2(d)+2}$ consecutive squares or non-squares in the forward orbit of $a$. In addition, we provide a classification of all polynomials for which our generic condition does not hold.Open AccessSquare patterns in dynamical orbits
Let $q$ be an odd prime power. Let $f\in \mathbb{F}_q[x]$ be a polynomial having degree at least $2$, $a\in \mathbb{F}_q$, and denote by $f^n$ the $n$-th iteration of $f$. Let $χ$ be the quadratic character of $\mathbb{F}_q$, and $\mathcal{O}_f(a)$ the forward orbit of $a$ under iteration by $f$. Suppose that the sequence $(χ(f^n(a)))_{n\geq 1}$ is periodic, and $m$ is its period. Assuming a mild and generic condition on $f$, we show that, up to a constant, $m$ can be bounded from below by $|\mathcal{O}_f(a)|/q^\frac{2\log_{2}(d)+1}{2\log_2(d)+2}$. More informally, we prove that the period of the appearance of squares in an orbit of an element provides an upper bound for the size of the orbit itself. Using a similar method, we can also prove that, up to a constant, we cannot have more than $q^\frac{2\log_2(d)+1}{2\log_2(d)+2}$ consecutive squares or non-squares in the forward orbit of $a$. In addition, we provide a classification of all polynomials for which our generic condition does not hold. - 16 October 2023
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 23 (07)
Number theoretical locally recoverable codes
In this paper, we give constructions for infinite sequences of finite nonlinear locally recoverable codes [ ] over a product of finite fields arising from basis expansions in algebraic number fields. The codes in our sequences have increasing length and size, constant rate, fixed locality, and minimum distance going to infinity.
- 16 October 2023
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 23 (07)
Number theoretical locally recoverable codes
In this paper, we give constructions for infinite sequences of finite nonlinear locally recoverable codes [ ] over a product of finite fields arising from basis expansions in algebraic number fields. The codes in our sequences have increasing length and size, constant rate, fixed locality, and minimum distance going to infinity.