7 citations · 7 across the 11 of their papers we have counts for
12 papers
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…
Sharper upper bounds for -ary and constant-weight codes
Stefano Della Fiore
We derive refined entropy upper bounds for -ary codes by exploiting the Fourier structure of the i.i.d. difference distribution . Since the pmf of is an autocor…
Graham conjecture on small sets in abelian groups
Simone Costa, Stefano Della Fiore, Mattia Fontana +1
A famous conjecture of Graham asserts that every set can be ordered so that all partial sums are distinct. Although this conjecture was r…
New bounds for (weak) sequenceability in
Simone Costa, Stefano Della Fiore
A famous conjecture of Graham asserts that every set can be ordered so that all partial sums are distinct. Although this conjecture was r…
Definability of some -ary Relations Over Second Order kinds of Logics
Simone Costa, Marco Dalai, Stefano Della Fiore +1
We consider the exprissibility in monadic second order logic of certain relations of importance in computer science. For integers and , a -tuple of sequences…
Graham's rearrangement for a class of semidirect products
Simone Costa, Stefano Della Fiore, Eva R. Engel
A famous conjecture of Graham asserts that every set can be ordered so that all partial sums are distinct. Bedert and Kravitz proved that…
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 -superimposed codes with runlength constraints. A -superimposed code of length is…
Existence of -Fold Non-zero sum Heffter arrays through local considerations
Simone Costa, Stefano Della Fiore
In [12] was introduced, for cyclic groups, the class of partially filled arrays of the non-zero sum Heffter array that are, as the Heffter arrays, related to difference families, g…
On Sequences in Cyclic Groups with Distinct Partial Sums
Simone Costa, Stefano Della Fiore, M. A. Ollis +1
A subset of an abelian group is {\em sequenceable} if there is an ordering of its elements such that the partial sums , given by $y_0…
The maximum cardinality of trifferent codes with lengths 5 and 6
Stefano Della Fiore, Alessandro Gnutti, Sven Polak
A code is said to be trifferent with length when for any three distinct elements of there exists a coordinate in which they…
A note on -separable codes and codes
Stefano Della Fiore, Marco Dalai
We derive a simple proof, based on information theoretic inequalities, of an upper bound on the largest rates of -ary -separable codes that improves recent results…
New upper bounds for -hashing
Stefano Della Fiore, Simone Costa, Marco Dalai
For fixed integers , the problem of perfect -hashing asks for the asymptotic growth of largest subsets of such that for any distinct elemen…