Stefano Della Fiore

Stefano Della Fiore

I am currently a researcher in the group of Multimedia Signal Processing in the Information Engineering department at the University of Brescia. Before I was a postdoctoral researcher in Information Theory and Combinatorics in the Computer Science department at the University of Salerno. Previously I was a PhD student in Information Engineering at the University of Brescia, under the guidance of Prof. Marco Dalai. My curriculum vitae is available here. See also my google scholar page for a list of my publications.

Contact Details

Office: 51 (see map), Dept. of Information Engineering, University of Brescia
Address: Via Branze 38, 25123 Brescia, Italy
Phone: +39 0303715934
E-mail: stefano.dellafiore@unibs.it

Research Interests

Zero-error capacity
Asymptotic growth of code rates
Combinatorial number theory
Algebraic and probabilistic methods in combinatorics
Applications of combinatorics to computer science
Multimedia data compression using deep learning techniques

Teaching

Publications and accepted manuscripts

All papers are available on my arXiv page.
  1. Sequencings in Semidirect Products via the Polynomial Method
    S. Costa, S. Della Fiore, M. A. Ollis, to appear in the 34th Midwestern Conference on Combinatorics and Combinatorial Computing.
    arXiv
  2. Variants of the Erdős distinct sums problem and variance method
    S. Costa, S. Della Fiore, A. Ferraguti, Discrete Applied Mathematics 369 (2025), 110-123.
    Journal arXiv
  3. An Efficient Algorithm for Group Testing with Runlength Constraints
    M. Dalai, S. Della Fiore, A. A. Rescigno, U. Vaccaro, Discrete Applied Mathematics 360 (2025), 181-187.
    Journal arXiv
  4. LiDAR Depth Map Guided Image Compression Model
    A. Gnutti, S. Della Fiore, M. Savardi, Y. Chen, R. Leonardi, W. Peng, IEEE International Conference on Image Processing (2024), 1890-1896.
    Proceedings arXiv
  5. Upper bounds on the rate of linear q-ary k-hash codes
    S. Della Fiore, M. Dalai, IEEE International Symposium on Information Theory (2024), 2610-2615.
    Proceedings arXiv
  6. Alternating Parity Weak Sequencing
    S. Costa, S. Della Fiore, Journal of Combinatorial Designs (2024), 308-327.
    Journal arXiv
  7. Higher degree Erdős distinct evaluations problem
    S. Costa, S. Della Fiore, A. Ferraguti, European Conference on Combinatorics, Graph Theory and Applications (2023), 314-319.
    Proceedings
  8. Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures
    M. Dalai, S. Della Fiore, A. A. Rescigno, U. Vaccaro, IEEE Information Theory Workshop (2023), 544-549.
    Proceedings arXiv
  9. Bounds on the Higher Degree Erdős-Ginzburg-Ziv Constants over Fnq
    S. Costa, S. Della Fiore, Archiv der Mathematik (2023), 17-29.
    Journal arXiv
  10. Existence of λ-fold non-zero sum Heffter arrays through local considerations
    S. Costa, S. Della Fiore, the Australasian Journal of Combinatorics 87 (2023), 301-339.
    Journal arXiv
  11. Weak Sequenceability in Cyclic Groups
    S. Costa, S. Della Fiore, Journal of Combinatorial Designs 30 (2022), 735-751.
    Journal arXiv
  12. Achievable Rates and Algorithms for Group Testing with Runlength Constraints
    S. Della Fiore, M. Dalai, U. Vaccaro, IEEE Information Theory Workshop (2022), 576-581.
    Proceedings arXiv
  13. On Sequences in Cyclic Groups with Distinct Partial Sums
    S. Costa, S. Della Fiore, M. A. Ollis, S. Z. Rovner-Frydman, The Electronic Journal of Combinatorics 3 (2022), P3.33.
    Journal arXiv tables code
  14. The maximum cardinality of trifferent codes with lengths 5 and 6
    S. Della Fiore, A. Gnutti, S. Polak, Examples and Counterexamples 2 (2022), 100051.
    Journal arXiv code
  15. Non-zero sum Heffter arrays and their applications
    S. Costa, S. Della Fiore, A. Pasotti, Discrete Mathematics 345 (2022), 112952.
    Journal arXiv additional material
  16. Variations on the Erdős distinct-sums problem
    S. Costa, M. Dalai, S. Della Fiore, Discrete Applied Mathematics 325 (2022), 172-185.
    Journal arXiv
  17. A note on 2-separable codes and B2 codes
    S. Della Fiore, M. Dalai, Discrete Mathematics 345 (2022), 112751.
    Journal arXiv
  18. Improved Bounds for (b,k)-hashing
    S. Della Fiore, S. Costa, M. Dalai, IEEE Transactions on Information Theory 68 (2022), 4983-4997.
    Journal arXiv additional material
  19. New upper bounds for (b,k)-hashing
    S. Della Fiore, S. Costa, M. Dalai, IEEE International Symposium on Information Theory (2021), 256-261.
    Proceedings arXiv

Preprints

  1. New results on the Graham’s rearrangement conjecture
    S. Costa, S. Della Fiore, E. Engel, in preparation.
  2. Bounds on k-hash distances and rates of linear codes
    S. Della Fiore, M. Dalai, in preparation.
  3. Graham's rearrangement for dihedral groups
    S. Costa, S. Della Fiore, E. Engel, submitted.
    arXiv
  4. TFIC: End-to-End Text-Focused Image Compression for Coding for Machines
    S. Della Fiore, A. Gnutti, M. Dalai, P. Migliorati, R. Leonardi, submitted.
    arXiv
  5. Weak Freiman isomorphisms and sequencings of small sets
    S. Costa, S. Della Fiore, submitted.
    arXiv

Seminars

PhD/M.Sc./B.Sc. Theses

Last updated: April 22, 2025.