Pages that link to "Item:Q887414"
From MaRDI portal
The following pages link to On tight bounds for binary frameproof codes (Q887414):
Displaying 13 items.
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets (Q300380) (← links)
- Constructions and bounds for separating hash families (Q724890) (← links)
- Some intriguing upper bounds for separating hash families (Q1729948) (← links)
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes (Q1741920) (← links)
- Improved bounds on 2-frameproof codes with length 4 (Q1755996) (← links)
- Wide-sense 2-frameproof codes (Q2211333) (← links)
- A tight bound for frameproof codes viewed in terms of separating hash families (Q2249796) (← links)
- Improved Constructions of Frameproof Codes (Q2989853) (← links)
- Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces (Q3190014) (← links)
- On Symmetric Designs and Binary 3-Frameproof Codes (Q3466753) (← links)
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes (Q4388977) (← links)
- Comments on "New results on frame-proof codes and traceability schemes (Q5281241) (← links)
- Secure Frameproof Code Through Biclique Cover (Q5403039) (← links)