In this paper, we study upper bounds on the minimum length of frameproof...
In this paper, we study bounds on the minimum length of
(k,n,d)-superimp...
A code 𝒞⊆{0, 1, 2}^n is said to be trifferent with
length n when for any...
For fixed integers b≥ k, the problem of perfect (b,k)-hashing asks for
t...
For a fixed integer k, a problem of relevant interest in computer scienc...