Stefano Della Fiore

activity

20202026

most citedAchievable Rates and Algorithms for Group Testing with Runlength Constraints

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

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

Bounds on the Higher Degree Erdős-Ginzburg-Ziv Constants over $F_{q}^{n}$

Simone Costa, Stefano Della Fiore

The classical Erdős-Ginzburg-Ziv constant of a group $G$ denotes the smallest positive integer $ℓ$ such that any sequence $S$ of length at least $ℓ$ contains a zero-sum subse…

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…

Bounds on the Higher Degree Erdős-Ginzburg-Ziv Constants over Fqn​

Achievable Rates and Algorithms for Group Testing with Runlength Constraints

Bounds on the Higher Degree Erdős-Ginzburg-Ziv Constants over $F_{q}^{n}$