Pages that link to "Item:Q897312"
From MaRDI portal
The following pages link to Constructing new covering arrays from LFSR sequences over finite fields (Q897312):
Displaying 11 items.
- Finite field constructions of combinatorial arrays (Q908047) (← links)
- Covering arrays from \(m\)-sequences and character sums (Q1675282) (← links)
- Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
- Number of \(t\)-tuples in arrays from LFSRs (Q1742692) (← links)
- Covering arrays of strength three from extended permutation vectors (Q1791674) (← links)
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm (Q2193001) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma (Q2333832) (← links)
- Subspace restrictions and affine composition for covering perfect hash families (Q5198019) (← links)
- An extension of a construction of covering arrays (Q6188123) (← links)
- Detecting arrays for effects of multiple interacting factors (Q6647744) (← links)
