The following pages link to Brett Stevens (Q241256):
Displaying 50 items.
- A construction for strength-3 covering arrays from linear feedback shift register sequences (Q404947) (← links)
- Divisibility of polynomials over finite fields and combinatorial applications (Q411500) (← links)
- Ordering block designs. Gray codes, universal cycles and configuration orderings (Q426279) (← links)
- Spanning trees with specified differences in Cayley graphs (Q442368) (← links)
- The coolest way to generate binary strings (Q489746) (← links)
- Sudoku-like arrays, codes and orthogonality (Q510424) (← links)
- Packing arrays (Q596146) (← links)
- Digraphs are 2-weight choosable (Q625384) (← links)
- Sets of orthogonal hypercubes of class \(r\) (Q654898) (← links)
- Packing arrays and packing designs (Q697642) (← links)
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs (Q712220) (← links)
- Cover starters for covering arrays of strength two (Q764881) (← links)
- A nonexistence certificate for projective planes of order ten with weight 15 codewords (Q780361) (← links)
- Constructing new covering arrays from LFSR sequences over finite fields (Q897312) (← links)
- Locating patterns in the de Bruijn torus (Q906472) (← links)
- A survey of known results and research areas for \(n\)-queens (Q998490) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- Universal cycles of \((n - 1)\)-partitions of an \(n\)-set (Q1044896) (← links)
- Research problems on Gray codes and universal cycles (Q1044897) (← links)
- Lower bounds for transversal covers (Q1281414) (← links)
- The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs. (Q1401313) (← links)
- Covering arrays from \(m\)-sequences and character sums (Q1675282) (← links)
- Number of \(t\)-tuples in arrays from LFSRs (Q1742692) (← links)
- The Lovász local lemma and variable strength covering arrays (Q1742696) (← links)
- Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\) (Q1850059) (← links)
- Class-uniformly resolvable group divisible structures. I: Resolvable group divisible designs (Q1883633) (← links)
- Class-uniformly resolvable group divisible structures. II: Frames (Q1883634) (← links)
- Bounds on covering codes in RT spaces using ordered covering arrays (Q2175413) (← links)
- A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes (Q2194505) (← links)
- Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma (Q2333832) (← links)
- Division of trinomials by pentanomials and orthogonal arrays (Q2384052) (← links)
- Covering arrays on graphs (Q2565691) (← links)
- Pancomponented 2-factorizations of complete graphs (Q2568477) (← links)
- A Sperner-type theorem for set-partition systems (Q2571313) (← links)
- (Q2713358) (← links)
- (Q2771902) (← links)
- (Q2808535) (← links)
- Cube Designs (Q2812295) (← links)
- A note on packing spanning trees in graphs and bases in matroids (Q2876023) (← links)
- Orthogonally Resolvable Cycle Decompositions (Q2950653) (← links)
- (Q2953097) (← links)
- Ordered Orthogonal Array Construction Using LFSR Sequences (Q2989662) (← links)
- (Q2999986) (← links)
- (Q3044334) (← links)
- Octahedral designs (Q3057078) (← links)
- Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms (Q3058530) (← links)
- De Bruijn Sequences for the Binary Strings with Maximum Density (Q3078396) (← links)
- (Q3085966) (← links)
- Geometrical constructions of class-uniformly resolvable structure (Q3100728) (← links)
- Uncoverings on graphs and network reliability (Q3101019) (← links)
