Stefano Della Fiore

activity

20212026

most citedThe maximum cardinality of trifferent codes with lengths 5 and 6

7 citations · 7 across the 11 of their papers we have counts for

collaborators

Showing cs.ITShow all

4 papers · 1 filter

cs.IT2026

Pareto-type finite-block optimality for source codes: a constrained Markov example

Stefano Della Fiore

We study a Pareto-type notion of finite-block optimality for injective source codes, where two codes are compared through the full sequence of expected block lengths. As a concrete…

cs.IT2026

Sharper upper bounds for $q$ -ary and constant-weight $B_{2}$ codes

Stefano Della Fiore

We derive refined entropy upper bounds for $q$ -ary $B_{2}$ codes by exploiting the Fourier structure of the i.i.d. difference distribution $D = X - Y$ . Since the pmf of $D$ is an autocor…

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…

cs.IT2021

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

Stefano Della Fiore, Simone Costa, Marco Dalai

For fixed integers $b \geq k$ , the problem of perfect $(b, k)$ -hashing asks for the asymptotic growth of largest subsets of ${1, 2, \dots, b}^{n}$ such that for any $k$ distinct elemen…

Pareto-type finite-block optimality for source codes: a constrained Markov example

Sharper upper bounds for q-ary and constant-weight B2​ codes

An Efficient Algorithm for Group Testing with Runlength Constraints

New upper bounds for (b,k)-hashing

Sharper upper bounds for $q$ -ary and constant-weight $B_{2}$ codes

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