Pages that link to "Item:Q4503517"
From MaRDI portal
The following pages link to New constructions of superimposed codes (Q4503517):
Displayed 19 items.
- Almost disjunctive list-decoding codes (Q259899) (← links)
- Synthetic sequence design for signal location search (Q378252) (← links)
- Improved constructions for non-adaptive threshold group testing (Q378256) (← 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)
- Coding for a multiple access OR channel: A survey (Q947083) (← links)
- On the upper bounds of the minimum number of rows of disjunct matrices (Q1024738) (← links)
- Trivial two-stage group testing for complexes using almost disjunct matrices. (Q1422408) (← links)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
- A group testing method for finding patterns in data (Q1885819) (← links)
- Bounds on the rate of disjunctive codes (Q2262991) (← links)
- List decoding for a multiple access hyperchannel (Q2364452) (← links)
- On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design (Q2426665) (← links)
- Strict group testing and the set basis problem (Q2452424) (← links)
- SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODES (Q3166740) (← links)
- Coding for a Multiple Access OR Channel: a Survey (Q3439269) (← links)
- Superimposed Codes and Threshold Group Testing (Q4915254) (← links)
- New Construction of Error-Tolerant Pooling Designs (Q4915255) (← links)
- (Q5150557) (← links)