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. End-to-End Semantic Preservation in Text-Aware Image Compression Systems
    S. Della Fiore, A. Gnutti, M. Dalai, P. Migliorati, R. Leonardi, to appear in Signal Processing: Image Communication (2026).
    arXiv
  2. Definability of some k-ary Relations Over Second Order kinds of Logics
    S. Costa, M. Dalai, S. Della Fiore, A. Pasotti, to appear in Communications in Combinatorics and Optimization (2026).
    Journal arXiv
  3. Sharper upper bounds for q-ary B2 codes from Toeplitz SDPs
    S. Della Fiore, IEEE International Symposium on Information Theory (2026), 1-6.
    Proceedings arXiv
  4. Sequencings in Semidirect Products via the Polynomial Method
    S. Costa, S. Della Fiore, M. A. Ollis, Springer Proceedings in Mathematics & Statistics 516 (2026).
    Proceedings arXiv
  5. Weak Freiman isomorphisms and sequencings of small sets
    S. Costa, S. Della Fiore, Discrete Mathematics 349(8) (2026), 115077.
    Journal arXiv
  6. Bounds on k-hash distances and rates of linear codes
    S. Della Fiore, M. Dalai, IEEE Transactions on Information Theory 72(2) (2026), 865-875.
    Journal arXiv
  7. Graham's rearrangement for dihedral groups
    S. Costa, S. Della Fiore, E. Engel, European Conference on Combinatorics, Graph Theory and Applications (2025), 326-331.
    Proceedings arXiv
  8. TFIC: End-to-End Text-Focused Image Compression for Coding for Machines
    S. Della Fiore, A. Gnutti, M. Dalai, P. Migliorati, R. Leonardi, IEEE European Signal Processing Conference (2025), 1382-1386.
    Proceedings arXiv
  9. 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
  10. 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
  11. 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
  12. 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
  13. Alternating Parity Weak Sequencing
    S. Costa, S. Della Fiore, Journal of Combinatorial Designs 32(6) (2024), 308-327.
    Journal arXiv
  14. Bounds on the Higher Degree Erdős-Ginzburg-Ziv Constants over 𝔽nq
    S. Costa, S. Della Fiore, Archiv der Mathematik 122 (2024), 17-29.
    Journal arXiv
  15. 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
  16. 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
  17. 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
  18. Variations on the Erdős distinct-sums problem
    S. Costa, M. Dalai, S. Della Fiore, Discrete Applied Mathematics 325 (2023), 172-185.
    Journal arXiv
  19. Weak Sequenceability in Cyclic Groups
    S. Costa, S. Della Fiore, Journal of Combinatorial Designs 30(12) (2022), 735-751.
    Journal arXiv
  20. 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
  21. 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 29(3) (2022), P3.33.
    Journal arXiv tables code
  22. 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
  23. Non-zero sum Heffter arrays and their applications
    S. Costa, S. Della Fiore, A. Pasotti, Discrete Mathematics 345(9) (2022), 112952.
    Journal arXiv additional material
  24. A note on 2-separable codes and B2 codes
    S. Della Fiore, M. Dalai, Discrete Mathematics 345(3) (2022), 112751.
    Journal arXiv
  25. Improved Bounds for (b,k)-hashing
    S. Della Fiore, S. Costa, M. Dalai, IEEE Transactions on Information Theory 68(8) (2022), 4983-4997.
    Journal arXiv additional material
  26. 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. A bandwidth refinement of the Erdős distinct subset sums bound
    S. Costa, S. Della Fiore, in preparation.
  2. Closed-form improved upper bounds for (b,k)-hashing
    S. Costa, M. Dalai, S. Della Fiore, in preparation.
  3. Equality of i.i.d. and constant-composition exponents for column-constrained zero-error codes
    S. Della Fiore, in preparation.
  4. Kneserized Anticoncentration and Reverse Absorption for Graham's Rearrangement Conjecture
    S. Costa, S. Della Fiore, T. Feng, H. Liu, submitted.
    arXiv
  5. A note on vector trifferent codes over the Sphere
    S. Della Fiore, submitted.
    arXiv
  6. Slice and Partition Rank Criteria for Polynomial Zero-Avoidance
    S. Costa, S. Della Fiore, M. Fontana, submitted.
    arXiv
  7. Pareto-type finite-block optimality for injective source codes: a constrained Markov example
    S. Della Fiore, submitted.
    arXiv
  8. Sharper upper bounds for q-ary and constant-weight B2 codes
    S. Della Fiore, submitted.
    arXiv
  9. Graham conjecture on small sets in abelian groups
    S. Costa, S. Della Fiore, M. Fontana, L. Vena, submitted.
    arXiv
  10. New bounds for (weak) sequenceability in ℤk
    S. Costa, S. Della Fiore, submitted.
    arXiv Erdős #475
  11. Graham's rearrangement for a class of semidirect products
    S. Costa, S. Della Fiore, E. Engel, submitted.
    arXiv

Seminars

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

Last updated: August 25, 2026.