2021
DOI: 10.1080/09728600.2021.1966349
|View full text |Cite
|
Sign up to set email alerts
|

Generalization of MacNeish’s Kronecker product theorem of mutually orthogonal Latin squares

Abstract: The subject of mutually orthogonal Latin squares (MOLSs) has fascinated researchers for many years. Although there is a number of intriguing results in this area, many open problems remain to which the answers seem as elusive as ever. Mutually orthogonal graph squares (MOGSs) are considered a generalization to MOLS. MOLS are considered an area of combinatorial design theory which has many applications in optical communications, cryptography, storage system design, wireless communications, communication protoco… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…MOGS for certain graphs were handled by [21]. El-Mesady et al [22] generalized the MacNeish's Kronecker product theorem of MOLS. MOGS were used to construct graph-transversal designs and graphauthentication codes in [3,23].…”
Section: Introductionmentioning
confidence: 99%
“…MOGS for certain graphs were handled by [21]. El-Mesady et al [22] generalized the MacNeish's Kronecker product theorem of MOLS. MOGS were used to construct graph-transversal designs and graphauthentication codes in [3,23].…”
Section: Introductionmentioning
confidence: 99%