The following pages link to New Bounds for Frameproof Codes (Q4566557):
Displaying 16 items.
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets (Q300380) (← links)
- Cover-free codes and separating system codes (Q510467) (← links)
- Symmetric disjunctive list-decoding codes (Q510468) (← links)
- Constructions and bounds for separating hash families (Q724890) (← links)
- On tight bounds for binary frameproof codes (Q887414) (← links)
- New upper bounds for parent-identifying codes and traceability codes (Q1650430) (← links)
- Some intriguing upper bounds for separating hash families (Q1729948) (← links)
- Improved bounds on 2-frameproof codes with length 4 (Q1755996) (← links)
- New bounds on 2-frameproof codes of length 4 (Q1989034) (← links)
- Wide-sense 2-frameproof codes (Q2211333) (← links)
- Improved Constructions of Frameproof Codes (Q2989853) (← links)
- Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces (Q3190014) (← links)
- Comments on "New results on frame-proof codes and traceability schemes (Q5281241) (← links)
- Secure Frameproof Code Through Biclique Cover (Q5403039) (← links)
- Detecting arrays for effects of single factors (Q6086392) (← links)
- Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions (Q6571302) (← links)