Orthogonal designs via computational algebra
DOI10.1002/JCD.20108zbMATH Open1100.05014OpenAlexW2075668496MaRDI QIDQ5487772FDOQ5487772
Ilias S. Kotsireas, Christos Koukouvinos
Publication date: 12 September 2006
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20108
Recommendations
- Orthogonal designs of order 32 and 64 via computational algebra
- Orthogonal designs for computer experiments
- Orthogonal designs. Hadamard matrices, quadratic forms and algebras
- Orthogonal and nearly orthogonal designs for computer experiments
- A new algorithm for computer searches for orthogonal designs
- Constructing orthogonal designs in powers of two via symbolic computation and rewriting techniques
- A recursive method for orthogonal designs
- Construction of orthogonal and nearly orthogonal designs for computer experiments
- Algorithmic construction of nearly column-orthogonal designs
- scientific article
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cites Work
Cited In (6)
- Hadamard matrices, quaternions, and the Pearson chi-square statistic
- Algebraic Generation of Orthogonal Fractional Factorial Designs
- Constructing orthogonal designs in powers of two via symbolic computation and rewriting techniques
- Extremal doubly-even self-dual codes from Hadamard matrices
- The asymptotic existence of orthogonal designs
- On a conjecture about linear processing complex orthogonal designs
This page was built for publication: Orthogonal designs via computational algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487772)
