Stefano Della Fiore

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 14

Top Topics

Efficiently Computable

Maximum Cardinality

Top Venues

IEEE Trans. Inf. Theory

Publications

Stefano Della Fiore, Marco Dalai
Upper bounds on the rate of linear q-ary k-hash codes. CoRR (2024)
Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures. CoRR (2023)
Simone Costa, Marco Dalai, Stefano Della Fiore
Variations on the Erdős distinct-sums problem. Discret. Appl. Math. 325 (2023)
Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures. ITW (2023)
Stefano Della Fiore, Simone Costa, Marco Dalai
Improved Bounds for (b, k)-Hashing. IEEE Trans. Inf. Theory 68 (8) (2022)
Simone Costa, Stefano Della Fiore, Anita Pasotti
Non-zero sum Heffter arrays and their applications. Discret. Math. 345 (9) (2022)
Simone Costa, Stefano Della Fiore, M. A. Ollis, Sarah Z. Rovner-Frydman
On Sequences in Cyclic Groups with Distinct Partial Sums. Electron. J. Comb. 29 (3) (2022)
Stefano Della Fiore, Marco Dalai, Ugo Vaccaro
Achievable Rates and Algorithms for Group Testing with Runlength Constraints. ITW (2022)
Stefano Della Fiore, Marco Dalai, Ugo Vaccaro
Achievable Rates and Algorithms for Group Testing with Runlength Constraints. CoRR (2022)
Stefano Della Fiore, Marco Dalai
codes. Discret. Math. 345 (3) (2022)
Stefano Della Fiore, Alessandro Gnutti, Sven C. Polak
The maximum cardinality of trifferent codes with lengths 5 and 6. CoRR (2022)
Stefano Della Fiore, Simone Costa, Marco Dalai
New upper bounds for (b, k)-hashing. CoRR (2021)
Stefano Della Fiore, Simone Costa, Marco Dalai
New upper bounds for (b, k)-hashing. ISIT (2021)
Stefano Della Fiore, Simone Costa, Marco Dalai
Further strengthening of upper bounds for perfect k-Hashing. CoRR (2020)