The following pages link to Frameproof Codes (Q4443104):
Displaying 30 items.
- Strongly separable codes (Q285247) (← links)
- Bounds and constructions for \(\overline{3}\)-separable codes with length 3 (Q306344) (← links)
- Improved bounds for separating hash families (Q369437) (← links)
- \((2,1)\)-separating systems beyond the probabilistic bound (Q375844) (← links)
- New bounds on \(\bar{2}\)-separable codes of length 2 (Q488247) (← links)
- Asymptotically optimal \(\overline {2}\)-separable codes with length 4 (Q507954) (← links)
- Constructions and bounds for separating hash families (Q724890) (← links)
- On tight bounds for binary frameproof codes (Q887414) (← links)
- A bound on the size of separating hash families (Q958729) (← links)
- New upper bounds for parent-identifying codes and traceability codes (Q1650430) (← links)
- Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3 (Q1699269) (← links)
- Some intriguing upper bounds for separating hash families (Q1729948) (← links)
- Improved bounds on 2-frameproof codes with length 4 (Q1755996) (← links)
- Frames as continuous redundant codes (Q1980454) (← links)
- New bounds on 2-frameproof codes of length 4 (Q1989034) (← links)
- A note on \(\overline{2} \)-separable codes and \(B_2\) codes (Q2065925) (← links)
- Wide-sense 2-frameproof codes (Q2211333) (← links)
- A tight bound for frameproof codes viewed in terms of separating hash families (Q2249796) (← links)
- List decoding for a multiple access hyperchannel (Q2364452) (← links)
- Sliding-window dynamic frameproof codes (Q2383995) (← links)
- Sequential and dynamic frameproof codes (Q2384002) (← links)
- Bounds for separating hash families (Q2431271) (← links)
- On generalized separating hash families (Q2469200) (← links)
- Optimal 2-traceability codes of length 4 (Q2697541) (← links)
- (Q5125452) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
- Secure Frameproof Code Through Biclique Cover (Q5403039) (← links)
- Near-sunflowers and focal families (Q6076184) (← links)
- Detecting arrays for effects of single factors (Q6086392) (← links)
- Improved upper bounds for the rate of separating and completely separating codes (Q6173461) (← links)
