The following pages link to (Q4884215):
Displaying 15 items.
- Constructing heterogeneous hash families by puncturing linear transversal designs (Q408964) (← links)
- Mutually orthogonal equitable Latin rectangles (Q536227) (← links)
- Ovals and hyperovals in nets (Q557076) (← links)
- Constructing strength three covering arrays with augmented annealing (Q924952) (← links)
- Quintessential pairwise balanced designs (Q1299033) (← links)
- Transversal designs in classical planes and spaces (Q1586132) (← links)
- Some new Kirkman signal sets (Q1671633) (← links)
- A lower bound on HMOLS with equal sized holes (Q2041120) (← links)
- A lower bound on permutation codes of distance \(n-1\) (Q2285776) (← links)
- Resolvable covering arrays (Q2320870) (← links)
- Relative difference sets partitioned by cosets (Q2409828) (← links)
- Concerning eight mutually orthogonal latin squares (Q3445490) (← links)
- New recursive methods for transversal covers (Q4242741) (← links)
- (Q4614041) (← links)
- Mutually orthogonal Latin squares: A brief survey of constructions (Q5935426) (← links)