scholarly journals An improved recursive construction for disjoint Steiner quadruple systems

2020 ◽  
Vol 28 (8) ◽  
pp. 551-567
Author(s):  
Tuvi Etzion ◽  
Junling Zhou
Keyword(s):  
Recursive Construction ◽  
Steiner Quadruple Systems

scholarly journals Classification of Flag-Transitive Steiner Quadruple Systems

2001 ◽  
Vol 94 (1) ◽  
pp. 180-190 ◽  
Author(s):  
Michael Huber
Keyword(s):  
Steiner Quadruple Systems

scholarly journals Recursive construction of perfect DNA molecules from imperfect oligonucleotides

2008 ◽  
Vol 4 (1) ◽  
pp. 191 ◽  
Author(s):  
Gregory Linshiz ◽  
Tuval Ben Yehezkel ◽  
Shai Kaplan ◽  
Ilan Gronau ◽  
Sivan Ravid ◽  
...  
Keyword(s):  
Recursive Construction ◽  
Dna Molecules

Dichotomous indexing of array in recursive construction of voxel-graphic images

2014 ◽  
Vol 75 (1) ◽  
pp. 119-128 ◽  
Author(s):  
S. N. Grigor’ev ◽  
A. V. Tolok
Keyword(s):  
Recursive Construction ◽  
Graphic Images

Constructions for cyclic 3-designs and improved results on cyclic Steiner quadruple systems

2010 ◽  
Vol 19 (3) ◽  
pp. 178-201 ◽  
Author(s):  
Tao Feng ◽  
Yanxun Chang
Keyword(s):  
Steiner Quadruple Systems

scholarly journals Recursive construction of continuum random trees

2018 ◽  
Vol 46 (5) ◽  
pp. 2715-2748 ◽  
Author(s):  
Franz Rembart ◽  
Matthias Winkel
Keyword(s):  
Random Trees ◽  
Recursive Construction

A new algorithm for a recursive construction of the minimal interpolation space

2009 ◽  
Vol 79 (12) ◽  
pp. 3587-3598
Author(s):  
D. Sbibih ◽  
A. Serghini ◽  
A. Tijini
Keyword(s):  
Interpolation Space ◽  
Recursive Construction

A Recursive Construction for New Symmetric Designs

2005 ◽  
Vol 35 (3) ◽  
pp. 303-310 ◽  
Author(s):  
Yury J. Ionin ◽  
Hadi Kharaghani
Keyword(s):  
Recursive Construction ◽  
Symmetric Designs

scholarly journals On Graph-Orthogonal Arrays by Mutually Orthogonal Graph Squares

Symmetry ◽  
2020 ◽  
Vol 12 (11) ◽  
pp. 1895 ◽  
Author(s):  
M. Higazy ◽  
A. El-Mesady ◽  
M. S. Mohamed
Keyword(s):  
Computer Science ◽  
Finite Fields ◽  
Orthogonal Array ◽  
Orthogonal Arrays ◽  
Latin Squares ◽  
Error Correcting Codes ◽  
Recursive Construction ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Definition Of

During the last two centuries, after the question asked by Euler concerning mutually orthogonal Latin squares (MOLS), essential advances have been made. MOLS are considered as a construction tool for orthogonal arrays. Although Latin squares have numerous helpful properties, for some factual applications these structures are excessively prohibitive. The more general concepts of graph squares and mutually orthogonal graph squares (MOGS) offer more flexibility. MOGS generalize MOLS in an interesting way. As such, the topic is attractive. Orthogonal arrays are essential in statistics and are related to finite fields, geometry, combinatorics and error-correcting codes. Furthermore, they are used in cryptography and computer science. In this paper, our current efforts have concentrated on the definition of the graph-orthogonal arrays and on proving that if there are k MOGS of order n, then there is a graph-orthogonal array, and we denote this array by G-OA(n2,k,n,2). In addition, several new results for the orthogonal arrays obtained from the MOGS are given. Furthermore, we introduce a recursive construction method for constructing the graph-orthogonal arrays.

Sign in / Sign up

Export Citation Format

Share Document