33 citations · 78 across the 45 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2022
Constructions and bounds for codes with restricted overlaps
Simon R. Blackburn, Navid Nasr Esfahani, Donald L. Kreher +1
Non-overlapping codes have been studied for almost 60 years. In such a code, no proper, non-empty prefix of any codeword is a suffix of any codeword. In this paper, we study codes…
cs.IT2015
A tight bound on the size of certain separating hash families
Chuan Guo, Douglas R. Stinson
In this paper, we present a new lower bound on the size of separating hash families of type {w_1^{q-1},w_2} where w_1 < w_2. Our result extends the paper by Guo et al. on binary fr…
cs.IT2014
On tight bounds for binary frameproof codes
Chuan Guo, Douglas R. Stinson, Tran van Trung
In this paper, we study -frameproof codes, which are equivalent to -separating hash families. Our main results concern binary codes, which are defined over an alphabet…