Stefano Della Fiore

activity

20222024

most citedAchievable Rates and Algorithms for Group Testing with Runlength Constraints

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

cs.IT2024

An Efficient Algorithm for Group Testing with Runlength Constraints

Marco Dalai, Stefano Della Fiore, Adele A. Rescigno +1

In this paper, we provide an efficient algorithm to construct almost optimal $(k, n, d)$ -superimposed codes with runlength constraints. A $(k, n, d)$ -superimposed code of length $t$ is…

math.CO2024

Variants of the Erdős distinct sums problem and variance method

Simone Costa, Stefano Della Fiore, Andrea Ferraguti

Let $Σ = {a_{1}, \dots, a_{n}}$ be a set of positive integers with $a_{1} < \dots < a_{n}$ such that all $2^{n}$ subset sums are pairwise distinct. A famous conjecture of Erdős states tha…

cs.IT2023

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures

Marco Dalai, Stefano Della Fiore, Adele A. Rescigno +1

In this paper, we study upper bounds on the minimum length of frameproof codes introduced by Boneh and Shaw to protect copyrighted materials. A $q$ -ary $(k, n)$ -frameproof code of l…

cs.IT2022★ 1 cited

Achievable Rates and Algorithms for Group Testing with Runlength Constraints

Stefano Della Fiore, Marco Dalai, Ugo Vaccaro

In this paper, we study bounds on the minimum length of $(k, n, d)$ -superimposed codes introduced by Agarwal et al. [1], in the context of Non-Adaptive Group Testing algorithms with…