Further strengthening of upper bounds for perfect k-Hashing. - Stefano Della Fiore; Simone Costa; Marco Dalai (CoRR, 2020)

New upper bounds for (b, k)-hashing. - Stefano Della Fiore; Simone Costa; Marco Dalai (ISIT, 2021)

Achievable Rates and Algorithms for Group Testing with Runlength Constraints. - Stefano Della Fiore; Marco Dalai; Ugo Vaccaro (ITW, 2022)

On Sequences in Cyclic Groups with Distinct Partial Sums. - Simone Costa; Stefano Della Fiore; M. A. Ollis; Sarah Z. Rovner-Frydman (Electron. J. Comb., 2022)

The maximum cardinality of trifferent codes with lengths 5 and 6. - Stefano Della Fiore; Alessandro Gnutti; Sven C. Polak (CoRR, 2022)

Non-zero sum Heffter arrays and their applications. - Simone Costa; Stefano Della Fiore; Anita Pasotti (Discret. Math., 2022)

A note on 2‾-separable codes and B2 codes. - Stefano Della Fiore; Marco Dalai (Discret. Math., 2022)

Improved Bounds for (b, k)-Hashing. - Stefano Della Fiore; Simone Costa; Marco Dalai (IEEE Trans. Inf. Theory, 2022)

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures. - Marco Dalai; Stefano Della Fiore; Adele A. Rescigno; Ugo Vaccaro (ITW, 2023)

Variations on the Erdős distinct-sums problem. - Simone Costa; Marco Dalai; Stefano Della Fiore (Discret. Appl. Math., 2023)

Lidar Depth Map Guided Image Compression Model. - Alessandro Gnutti; Stefano Della Fiore; Mattia Savardi; Yi-Hsin Chen; Riccardo Leonardi; Wen-Hsiao Peng (ICIP, 2024)

Upper Bounds on the Rate of Linear Q-Ary K-Hash Codes. - Stefano Della Fiore; Marco Dalai (ISIT, 2024)

An efficient algorithm for group testing with runlength constraints. - Marco Dalai; Stefano Della Fiore; Adele A. Rescigno; Ugo Vaccaro (Discret. Appl. Math., 2025)

TFIC: End-to-End Text-Focused Image Compression for Coding for Machines. - Stefano Della Fiore; Alessandro Gnutti; Marco Dalai; Pierangelo Migliorati; Riccardo Leonardi (CoRR, 2025)

Bounds on k-hash distances and rates of linear codes. - Stefano Della Fiore; Marco Dalai (CoRR, 2025)