Pages that link to "Item:Q5342842"
From MaRDI portal
The following pages link to Nonrandom binary superimposed codes (Q5342842):
Displayed 46 items.
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others (Q696905) (← links)
- Tracing a single user (Q850073) (← links)
- Generalised cumulative arrays in secret sharing (Q851749) (← links)
- Codes identifying sets of vertices in random networks (Q870971) (← links)
- Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices (Q875600) (← links)
- Faster deterministic wakeup in multiple access channels (Q881569) (← links)
- Uniqueness of some optimal superimposed codes (Q926629) (← links)
- Pooling spaces associated with finite geometry (Q932830) (← links)
- Group testing with random pools: Phase transitions and optimal strategy (Q937098) (← links)
- General theory of information transfer: Updated (Q947076) (← links)
- Coding for a multiple access OR channel: A survey (Q947083) (← links)
- More on pooling spaces (Q998372) (← links)
- Construction of a superimposed code using partitions (Q1000098) (← links)
- The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks (Q1003769) (← links)
- On some connections between permutations and coding (Q1068049) (← links)
- Non-adaptive group testing in the presence of errors (Q1281776) (← links)
- On the upper bound of the size of the \(r\)-cover-free families (Q1328402) (← links)
- A simple construction of \(d\)-disjunct matrices with certain constant weights (Q1356684) (← links)
- Two applications of separating systems to nonadaptive procedures (Q1357749) (← links)
- Distributed broadcast in radio networks of unknown topology. (Q1401336) (← links)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
- Generalized cover-free families. (Q1428544) (← links)
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures (Q1569877) (← links)
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism (Q1770372) (← links)
- A universal bound for a covering in regular posets and its application to pool testing (Q1810653) (← links)
- Application of cover-free codes and combinatorial designs to two-stage testing. (Q1811089) (← links)
- Pooling spaces and non-adaptive pooling designs (Q1827741) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- Some new bounds for cover-free families (Q1976329) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design (Q2426665) (← links)
- New combinatorial structures with applications to efficient group testing with inhibitors (Q2426666) (← links)
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis (Q2426667) (← links)
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071) (← links)
- A novel use of \(t\)-packings to construct \(d\)-disjunct matrices (Q2499596) (← links)
- A classification of the structures of some Sperner families and superimposed codes (Q2502898) (← links)
- Deterministic M2M multicast in radio networks (Q2508975) (← links)
- Coding for a Multiple Access OR Channel: a Survey (Q3439269) (← links)
- Codes Identifying Vertices in Graphs (Q3439339) (← links)
- (Q4487082) (← links)
- RESILIENT LKH: SECURE MULTICAST KEY DISTRIBUTION SCHEMES (Q5493902) (← links)
- Superimposed codes for the search model of a. renyi (Q5749299) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)
- Explicit constructions of perfect hash families from algebraic curves over finite fields (Q5929836) (← links)
- Efficient algorithms for chemical threshold testing problems (Q5941290) (← links)
- Optimal superimposed codes and designs for Renyi's search model (Q5957831) (← links)