Stefano DELLA FIORE

My current research activity is focused on finding new improved upper bounds on the cardinality of a set of vectors of length n over an alphabet of size k, with the property that, for every subset of k vectors there is a coordinate in which they all differ.
My research is mainly based on the work of Simone Costa and Marco Dalai in which they found different new upper bounds for k=4, 5, 6 (2017-2020).
The best known bounds for k > 6 (2018) are due to the work of Venkatesan Guruswami, in which he improved the previous bounds of Fredman and Komlós (1984).