The following pages link to (Q3195092):
Displaying 16 items.
- A construction for strength-3 covering arrays from linear feedback shift register sequences (Q404947) (← links)
- Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
- Cover starters for covering arrays of strength two (Q764881) (← links)
- Augmentation of covering arrays of strength two (Q897271) (← links)
- A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
- Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- Algorithmic methods for covering arrays of higher index (Q2103319) (← links)
- Resolvable covering arrays (Q2320870) (← links)
- A group-based structure for perfect sequence covering arrays (Q2692963) (← links)
- (Q2927763) (← links)
- Suitable Permutations, Binary Covering Arrays, and Paley Matrices (Q3466746) (← links)
- Randomized Post-optimization for t-Restrictions (Q4915260) (← links)
- Upper Bounds on the Size of Covering Arrays (Q5270407) (← links)
- Detecting arrays for effects of single factors (Q6086392) (← links)
- Detecting arrays for effects of multiple interacting factors (Q6647744) (← links)
