NEW BOUNDS FOR PERFECT k-HASHING
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.
|
![]() |
Presentation of the first-year research activities (November 25, 2020)
Curriculum: Telecommunication Engineering
Tutor: Marco DALAI
email: s.dellafiore001@unibs.it
Link to the research group web page
Link to publication list