Stefano Della Fiore

activity

20242026

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.IT2024

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

Stefano Della Fiore, Marco Dalai

This paper presents new upper bounds on the rate of linear $k$ -hash codes in $F_{q}^{n}$ , $q \geq k$ , that is, codes with the property that any $k$ distinct codewords are all s…

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

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

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

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