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 2021Show all

2 papers · 1 filter

math.CO2021

A note on $2$ -separable codes and $B_{2}$ 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 $q$ -ary $2$ -separable codes that improves recent results…

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…

A note on 2-separable codes and B2​ codes

New upper bounds for (b,k)-hashing

A note on $2$ -separable codes and $B_{2}$ codes

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