Pages that link to "Item:Q2262991"
From MaRDI portal
The following pages link to Bounds on the rate of disjunctive codes (Q2262991):
Displayed 17 items.
- Almost disjunctive list-decoding codes (Q259899) (← links)
- Cover-free codes and separating system codes (Q510467) (← links)
- Symmetric disjunctive list-decoding codes (Q510468) (← links)
- Almost cover-free codes and designs (Q510471) (← links)
- Almost separable matrices (Q512882) (← links)
- Bounds on the rate of separating codes (Q1752294) (← links)
- Separable collusion-secure multimedia codes (Q2044131) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- Sampling schemes and recovery algorithms for functions of few coordinate variables (Q2307488) (← links)
- List decoding for a multiple access hyperchannel (Q2364452) (← links)
- Almost cover-free codes (Q2364463) (← links)
- Strict group testing and the set basis problem (Q2452424) (← links)
- Lower bounds for cover-free families (Q2629487) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Almost Optimal Cover-Free Families (Q5283363) (← links)
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks (Q5919324) (← links)
- (Q6087218) (← links)