The following pages link to Upper Bounds on Separating Codes (Q3546728):
Displaying 10 items.
- Yet another variation on minimal linear codes (Q259266) (← links)
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets (Q300380) (← links)
- The \(t\)-wise intersection of relative two-weight codes (Q477160) (← links)
- New upper bounds on cardinality of separating systems (Q1310762) (← links)
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes (Q1741920) (← links)
- Bounds on the rate of separating codes (Q1752294) (← links)
- Bounds on the rate of disjunctive codes (Q2262991) (← links)
- On generalized separating hash families (Q2469200) (← links)
- Separation and Witnesses (Q5322994) (← links)
- LATIN 2004: Theoretical Informatics (Q5901652) (← links)