Stefano Della Fiore

According to our database, Stefano Della Fiore authored at least 11 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Upper bounds on the rate of linear q-ary k-hash codes.

Stefano Della Fiore, Marco Dalai

CoRR, 2024

2023

Variations on the Erdős distinct-sums problem.

Simone Costa, Marco Dalai, Stefano Della Fiore

Discret. Appl. Math., 2023

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures.

Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro

Proceedings of the IEEE Information Theory Workshop, 2023

2022

Improved Bounds for (b, k)-Hashing.

Stefano Della Fiore, Simone Costa, Marco Dalai

IEEE Trans. Inf. Theory, 2022

A note on 2‾-separable codes and <i>B</i>₂ codes.

Stefano Della Fiore, Marco Dalai

Discret. Math., 2022

Non-zero sum Heffter arrays and their applications.

Simone Costa, Stefano Della Fiore, Anita Pasotti

Discret. Math., 2022

The maximum cardinality of trifferent codes with lengths 5 and 6.

Stefano Della Fiore, Alessandro Gnutti, Sven C. Polak

CoRR, 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

Achievable Rates and Algorithms for Group Testing with Runlength Constraints.

Stefano Della Fiore, Marco Dalai, Ugo Vaccaro

Proceedings of the IEEE Information Theory Workshop, 2022

2021

New upper bounds for (b, k)-hashing.

Stefano Della Fiore, Simone Costa, Marco Dalai

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Further strengthening of upper bounds for perfect k-Hashing.

Stefano Della Fiore, Simone Costa, Marco Dalai

CoRR, 2020