1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
Gábor Hegedüs
In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.