Alberto Ravagnani
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
Alberto Ravagnani has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Elisa Gorla
Institute of Mathematics, University of Neuchtel, Neuchtel, Switzerland
5 shared publications - Aida Abiad
Eindhoven University of Technology, Vrije Universiteit Brussel
4 shared publications - Eimear Byrne
University College Dublin
4 shared publications - Altan B. Kılıç
Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands
3 shared publications - Eitan Yaakobi
Department of Computer Science, Technion—Israel Institute of Technology, Haifa, Israel
3 shared publications - Gianira N. Alfarano
University College Dublin, Belfield, Dublin 4, Ireland
3 shared publications
Latest Publications
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (9) , 6493-6503
The Random Variables of the DNA Coverage Depth Problem
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (9) , 6493-6503
The Random Variables of the DNA Coverage Depth Problem
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (6) , 3840-3847
The Asymptotic Number of Equivalence Classes of Linear Codes With Given Dimension
We investigate the asymptotic number of equivalence classes of linear codes with prescribed length and dimension. While the total number of inequivalent codes of a given length has been studied previously, the case where the dimension varies as a function of the length has not yet been considered. We derive explicit asymptotic formulas for the number of equivalence classes under three standard notions of equivalence, for a fixed alphabet size and increasing length. Our approach also yields an exact asymptotic expression for the sum of all $q$ -binomial coefficients, which is of independent interest and answers an open question in this context. Finally, we establish a natural connection between these asymptotic quantities and certain discrete Gaussian distributions arising from Brownian motion, providing a probabilistic interpretation of our results.
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (6) , 3840-3847
The Asymptotic Number of Equivalence Classes of Linear Codes With Given Dimension
We investigate the asymptotic number of equivalence classes of linear codes with prescribed length and dimension. While the total number of inequivalent codes of a given length has been studied previously, the case where the dimension varies as a function of the length has not yet been considered. We derive explicit asymptotic formulas for the number of equivalence classes under three standard notions of equivalence, for a fixed alphabet size and increasing length. Our approach also yields an exact asymptotic expression for the sum of all $q$ -binomial coefficients, which is of independent interest and answers an open question in this context. Finally, we establish a natural connection between these asymptotic quantities and certain discrete Gaussian distributions arising from Brownian motion, providing a probabilistic interpretation of our results.
- Open Access
The Oval Strikes Back
We investigate the applications of ovals in projective planes to distributed storage, with a focus on the Service Rate Region problem. Leveraging the incidence relations between lines and ovals, we describe a class of non-systematic MDS matrices with a large number of small and disjoint recovery sets. For certain parameter choices, the service-rate region of these matrices contains the region of a systematic generator matrix for the same code, yielding better service performance. We further apply our construction to analyze the PIR properties of the considered MDS matrices and present a one-step majority-logic decoding algorithm with strong error-correcting capability. These results highlight how ovals, a classical object in finite geometry, re-emerge as a useful tool in modern coding theory.
Open AccessThe Oval Strikes Back
We investigate the applications of ovals in projective planes to distributed storage, with a focus on the Service Rate Region problem. Leveraging the incidence relations between lines and ovals, we describe a class of non-systematic MDS matrices with a large number of small and disjoint recovery sets. For certain parameter choices, the service-rate region of these matrices contains the region of a systematic generator matrix for the same code, yielding better service performance. We further apply our construction to analyze the PIR properties of the considered MDS matrices and present a one-step majority-logic decoding algorithm with strong error-correcting capability. These results highlight how ovals, a classical object in finite geometry, re-emerge as a useful tool in modern coding theory.
- Open Access
Weighted-Hamming Metric: Bounds and Codes
The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of importance or noise. From a coding-theoretic perspective, the actual error-correction capability of a code under this metric can exceed half its minimum distance. In this work, we establish direct bounds on this capability, tightening those obtained via minimum-distance arguments. We also propose a flexible code construction based on generalized concatenation and show that these codes can be efficiently decoded up to a lower bound on the error-correction capability.
Open AccessWeighted-Hamming Metric: Bounds and Codes
The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of importance or noise. From a coding-theoretic perspective, the actual error-correction capability of a code under this metric can exceed half its minimum distance. In this work, we establish direct bounds on this capability, tightening those obtained via minimum-distance arguments. We also propose a flexible code construction based on generalized concatenation and show that these codes can be efficiently decoded up to a lower bound on the error-correction capability.
- Open Access
The Star Product of Uniformly Random Codes
We consider the problem of determining the expected dimension of the star product of two uniformly random linear codes that are not necessarily of the same dimension. We achieve this by establishing a correspondence between the star product and the evaluation of bilinear forms, which we use to provide a lower bound on the expected star product dimension. We show that asymptotically in both the field size q and the dimensions of the two codes, the expected dimension reaches its maximum. Lastly, we discuss some implications related to private information retrieval, secure distributed matrix multiplication, quantum error correction, and the potential for exploiting the results in cryptanalysis.
Open AccessThe Star Product of Uniformly Random Codes
We consider the problem of determining the expected dimension of the star product of two uniformly random linear codes that are not necessarily of the same dimension. We achieve this by establishing a correspondence between the star product and the evaluation of bilinear forms, which we use to provide a lower bound on the expected star product dimension. We show that asymptotically in both the field size q and the dimensions of the two codes, the expected dimension reaches its maximum. Lastly, we discuss some implications related to private information retrieval, secure distributed matrix multiplication, quantum error correction, and the potential for exploiting the results in cryptanalysis.
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (12) , 9395-9412
A Combinatorial Perspective on Random Access Efficiency for DNA Storage
We investigate the fundamental limits of the recently proposed random access coverage depth problem for DNA data storage. Under this paradigm, it is assumed that the user information consists of k information strands, which are encoded into n strands via a generator matrix G. During the sequencing process, the strands are read uniformly at random, as each strand is available in a large number of copies. In this context, the random access coverage depth problem refers to the expected number of reads (i.e., sequenced strands) required to decode a specific information strand requested by the user. This problem heavily depends on the generator matrix G, and besides computing the expectation for different choices of G, the goal is to construct matrices that minimize the maximum expectation over all possible requested information strands, denoted by Tmax(G). In this paper, we introduce new techniques to investigate the random access coverage depth problem, capturing its combinatorial nature and identifying the structural properties of generator matrices that are advantageous. We establish two general formulas to determine Tmax(G) for arbitrary generator matrices. The first formula depends on the linear dependencies between columns of G, whereas the second formula takes into account recovery sets and their intersection structure. We also introduce the concept of recovery balanced codes and provide three sufficient conditions for a code to be recovery balanced. These conditions can be used to compute Tmax(G) for various families of codes, such as MDS, simplex, Hamming, and binary Reed-Muller codes. Additionally, we study the performance of modified systematic MDS and simplex matrices, showing that the best results for Tmax(G) are achieved with a specific combination of encoded strands and replication of the information strands.
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (12) , 9395-9412
A Combinatorial Perspective on Random Access Efficiency for DNA Storage
We investigate the fundamental limits of the recently proposed random access coverage depth problem for DNA data storage. Under this paradigm, it is assumed that the user information consists of k information strands, which are encoded into n strands via a generator matrix G. During the sequencing process, the strands are read uniformly at random, as each strand is available in a large number of copies. In this context, the random access coverage depth problem refers to the expected number of reads (i.e., sequenced strands) required to decode a specific information strand requested by the user. This problem heavily depends on the generator matrix G, and besides computing the expectation for different choices of G, the goal is to construct matrices that minimize the maximum expectation over all possible requested information strands, denoted by Tmax(G). In this paper, we introduce new techniques to investigate the random access coverage depth problem, capturing its combinatorial nature and identifying the structural properties of generator matrices that are advantageous. We establish two general formulas to determine Tmax(G) for arbitrary generator matrices. The first formula depends on the linear dependencies between columns of G, whereas the second formula takes into account recovery sets and their intersection structure. We also introduce the concept of recovery balanced codes and provide three sufficient conditions for a code to be recovery balanced. These conditions can be used to compute Tmax(G) for various families of codes, such as MDS, simplex, Hamming, and binary Reed-Muller codes. Additionally, we study the performance of modified systematic MDS and simplex matrices, showing that the best results for Tmax(G) are achieved with a specific combination of encoded strands and replication of the information strands.
- Open Access
The Eigenvalue Method in Coding Theory
We lay down the foundations of the Eigenvalue Method in coding theory. The method uses modern algebraic graph theory to derive upper bounds on the size of error-correcting codes for various metrics, addressing major open questions in the field. We identify the core assumptions that allow applying the Eigenvalue Method, test it for multiple well-known classes of error-correcting codes, and compare the results with the best bounds currently available. By applying the Eigenvalue Method, we obtain new bounds on the size of error-correcting codes that often improve the state of the art. Our results show that spectral graph theory techniques capture structural properties of error-correcting codes that are missed by classical coding theory approaches.
Open AccessThe Eigenvalue Method in Coding Theory
We lay down the foundations of the Eigenvalue Method in coding theory. The method uses modern algebraic graph theory to derive upper bounds on the size of error-correcting codes for various metrics, addressing major open questions in the field. We identify the core assumptions that allow applying the Eigenvalue Method, test it for multiple well-known classes of error-correcting codes, and compare the results with the best bounds currently available. By applying the Eigenvalue Method, we obtain new bounds on the size of error-correcting codes that often improve the state of the art. Our results show that spectral graph theory techniques capture structural properties of error-correcting codes that are missed by classical coding theory approaches.
- Open Access
The Coverage Depth Problem in DNA Storage Over Small Alphabets
The coverage depth problem in DNA data storage is about minimizing the expected number of reads until all data is recovered. When they exist, MDS codes offer the best performance in this context. This paper focuses on the scenario where the base field is not large enough to allow the existence of MDS codes. We investigate the performance for the coverage depth problem of codes defined over a small finite field, providing closed formulas for the expected number of reads for various code families. We also compare the results with the theoretical bounds in asymptotic regimes. The techniques we apply range from probability, to duality theory and combinatorics.
Open AccessThe Coverage Depth Problem in DNA Storage Over Small Alphabets
The coverage depth problem in DNA data storage is about minimizing the expected number of reads until all data is recovered. When they exist, MDS codes offer the best performance in this context. This paper focuses on the scenario where the base field is not large enough to allow the existence of MDS codes. We investigate the performance for the coverage depth problem of codes defined over a small finite field, providing closed formulas for the expected number of reads for various code families. We also compare the results with the theoretical bounds in asymptotic regimes. The techniques we apply range from probability, to duality theory and combinatorics.
- Open Access
Equivalence of Serial and Parallel A-Posteriori Probabilities in the Decoding of DAB Systems
Motivated by applications to digital audio broadcasting (DAB) systems, we study the a-posteriori probabilities (APPs) of the coded and information bits of the serial concatenation of multiple convolutional codewords. The main result of this correspondence is a proof that the APPs of the input bits do not change when considering the concatenation of multiple codewords as a received sequence. This is a purely theoretical result, which remains valid for every convolutional code, as long as the encoder goes back to the zero state at the end of each codeword. An equivalent heuristic for serial concatenation in Viterbi decoding is described. The applicability of our result to DAB systems, where interleaving and modulation are accounted for, is investigated through Matlab simulations. We show that the Bit Error Rate (BER) of the simulated DAB system does not change when decoding multiple transmitted codewords as one serially concatenated sequence, even when considering all the features of a DAB system.
Open AccessEquivalence of Serial and Parallel A-Posteriori Probabilities in the Decoding of DAB Systems
Motivated by applications to digital audio broadcasting (DAB) systems, we study the a-posteriori probabilities (APPs) of the coded and information bits of the serial concatenation of multiple convolutional codewords. The main result of this correspondence is a proof that the APPs of the input bits do not change when considering the concatenation of multiple codewords as a received sequence. This is a purely theoretical result, which remains valid for every convolutional code, as long as the encoder goes back to the zero state at the end of each codeword. An equivalent heuristic for serial concatenation in Viterbi decoding is described. The applicability of our result to DAB systems, where interleaving and modulation are accounted for, is investigated through Matlab simulations. We show that the Bit Error Rate (BER) of the simulated DAB system does not change when decoding multiple transmitted codewords as one serially concatenated sequence, even when considering all the features of a DAB system.