Pages that link to "Item:Q1569877"
From MaRDI portal
The following pages link to Secure frameproof codes, key distribution patterns, group testing algorithms and related structures (Q1569877):
Displayed 50 items.
- Strongly separable codes (Q285247) (← links)
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets (Q300380) (← links)
- Bounds and constructions for \(\overline{3}\)-separable codes with length 3 (Q306344) (← links)
- On generalizations of separating and splitting families (Q311557) (← links)
- Improved bounds for separating hash families (Q369437) (← links)
- On optimal cryptographic key derivation (Q388109) (← links)
- Non-adaptive complex group testing with multiple positive sets (Q393127) (← 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)
- Generalised cumulative arrays in secret sharing (Q851749) (← links)
- Secret sharing schemes with partial broadcast channels (Q851779) (← links)
- Explicit constructions of separating hash families from algebraic curves over finite fields (Q851784) (← links)
- On tight bounds for binary frameproof codes (Q887414) (← links)
- Uniqueness of some optimal superimposed codes (Q926629) (← links)
- A bound on the size of separating hash families (Q958729) (← links)
- Explicit constructions for perfect hash families (Q1008968) (← links)
- Linear hash families and forbidden configurations (Q1009168) (← links)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
- Splitting systems and separating systems. (Q1428538) (← links)
- Generalized cover-free families. (Q1428544) (← links)
- Perfect hash families: Probabilistic methods and explicit constructions (Q1586126) (← links)
- Frameproof codes against limited coalitions of pirates (Q1605345) (← links)
- A hierarchical framework for recovery in compressive sensing (Q1693135) (← 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)
- New constructions for IPP codes (Q1781000) (← links)
- A group testing method for finding patterns in data (Q1885819) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- Some new bounds for cover-free families (Q1976329) (← links)
- Wide-sense 2-frameproof codes (Q2211333) (← links)
- A tight bound for frameproof codes viewed in terms of separating hash families (Q2249796) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- Error-tolerant nonadaptive interval group testing with density-based tests (Q2310744) (← links)
- Distributing hash families with few rows (Q2333821) (← links)
- A sequence approach to linear perfect hash families (Q2384060) (← links)
- New combinatorial structures with applications to efficient group testing with inhibitors (Q2426666) (← links)
- Bounds for separating hash families (Q2431271) (← links)
- On generalized separating hash families (Q2469200) (← links)
- Geometric constructions of optimal linear perfect hash families (Q2469464) (← links)
- Binary fingerprinting codes (Q2486878) (← links)
- Recursive constructions of secure codes and hash families using difference function families. (Q2490863) (← links)
- Distributing the encryption and decryption of a block cipher (Q2572965) (← links)
- (Q2741412) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- Non-adaptive Complex Group Testing with Multiple Positive Sets (Q3010399) (← links)
- On Symmetric Designs and Binary 3-Frameproof Codes (Q3466753) (← links)
- A recursive construction for perfect hash families (Q3558748) (← links)
- On optimal superimposed codes (Q4458733) (← links)