Stefano Della Fiore

collaborators

2 papers

cs.IT2025

Bounds on $k$ -hash distances and rates of linear codes

Stefano Della Fiore, Marco Dalai

In this paper, we bound the rate of linear codes in $F_{q}^{n}$ with the property that any $k \leq q$ codewords are all simultaneously distinct in at least $d_{k}$ coordinates. F…

math.CO2022

Weak Sequenceability in Cyclic Groups

Simone Costa, Stefano Della Fiore

A subset $A$ of an abelian group $G$ is sequenceable if there is an ordering $(a_{1}, \dots, a_{k})$ of its elements such that the partial sums $(s_{0}, s_{1}, \dots, s_{k})$ , given by $s_…

Bounds on k-hash distances and rates of linear codes

Weak Sequenceability in Cyclic Groups

Bounds on $k$ -hash distances and rates of linear codes