Results 1 to 10 of about 4,277 (127)
Difference Covering Arrays and Pseudo-Orthogonal Latin Squares [PDF]
A pair of Latin squares, A and B, of order n, is said to be pseudo-orthogonal if each symbol in A is paired with every symbol in B precisely once, except for one symbol with which it is paired twice and one symbol with which it is not paired at all.
F. Demirkale +4 more
semanticscholar +2 more sources
A novel application on mutually orthogonal graph squares and graph-orthogonal arrays
Security of personal information has become a major concern due to the increasing use of the Internet by individuals in the digital world. The main purpose here is to prevent an unauthorized person from gaining access to confidential information.
A. El-Mesady +2 more
semanticscholar +1 more source
Mutually Orthogonal Sudoku Latin Squares and Their Graphs [PDF]
We introduce a graph attached to mutually orthogonal Sudoku Latin squares. The spectra of the graphs obtained from finite fields are explicitly determined. As a corollary, we then use the eigenvalues to distinguish non-isomorphic Sudoku Latin squares.
Sho Kubota, Sho Suda, Akane Urano
semanticscholar +1 more source
On Weighted-Sum Orthogonal Latin Squares and Secret Sharing
Latin squares are a classical and well-studied topic of discrete mathematics, and recently Takeuti and Adachi (IACR ePrint, 2023) proposed (2 , n ) -threshold secret sharing based on mutually orthogonal Latin squares (MOLS). Hence efficient constructions
Koji Nuida, Tomoko Adachi
semanticscholar +1 more source
A general construction method for component orthogonal arrays
Order‐of‐addition (OofA) experiments have gained renewed attention in recent years, especially in regard to their design. For these experiments, the response is determined by the order in which components are added.
Chunyan Wang +2 more
semanticscholar +1 more source
Partially Balanced 3-Designs using Mutually Orthogonal Latin Squares
t-designs represent a generalized class of balanced incomplete block designs in which the number of blocks in which any t treatments (t ≥ 2) occur together is a constant.
Sayantani Karmakar +4 more
semanticscholar +1 more source
Cycles of quadratic Latin squares and antiperfect 1‐factorisations [PDF]
A Latin square of order n $n$ is an n × n $n\times n$ matrix of n $n$ symbols, such that each symbol occurs exactly once in each row and column. For an odd prime power q $q$ let F q ${{\mathbb{F}}}_{q}$ denote the finite field of order q $q$ .
J. Allsop
semanticscholar +1 more source
On Graph-Orthogonal Arrays by Mutually Orthogonal Graph Squares
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.
M. Higazy, A. El-Mesady, M. S. Mohamed
semanticscholar +1 more source
On generalized strong complete mappings and mutually orthogonal Latin squares
We present an application of generalized strong complete mappings to construction of a family of mutually orthogonal Latin squares. We also determine a cycle structure of such mapping which form a complete family of MOLS.
A. Muratovic-Ribic
semanticscholar +1 more source
We review results for the embedding of orthogonal partial Latin squares in orthogonal Latin squares, comparing and contrasting these with results for embedding partial Latin squares in Latin squares.
D. Donovan, M. Grannell, E. Yazici
semanticscholar +1 more source

