The following pages link to (Q4664666):
Displayed 6 items.
- Almost disjunctive list-decoding codes (Q259899) (← links)
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others (Q696905) (← links)
- Uniqueness of some optimal superimposed codes (Q926629) (← links)
- Construction of a superimposed code using partitions (Q1000098) (← links)
- Bounds on the rate of disjunctive codes (Q2262991) (← links)
- A note on the uniqueness of \((w, r)\) cover-free codes (Q2432945) (← links)