Results 91 to 100 of about 4,854 (122)

Computing random r-orthogonal Latin squares

International Conference on Combinatorial Optimization and Applications, 2023
Two Latin squares of order $n$ are $r$-orthogonal if, when superimposed, there are exactly $r$ distinct ordered pairs. The spectrum of all values of $r$ for Latin squares of order $n$ is known. A Latin square $A$ of order $n$ is $r$-self-orthogonal if $A$
Sergey Bereg
semanticscholar   +1 more source

Error Control Codes Based Modified Orthogonal Latin Squares for High-Speed Cache Memories

2023 IEEE 16th Dallas Circuits and Systems Conference (DCAS), 2023
Traditionally, error control codes (ECCs) have been employed to protect cache memory from hard and soft errors. Single error correction (SEC) codes are commonly used in high-speed caches due to their simple and fast decoding circuitry.
R. A. Ahmed
semanticscholar   +1 more source

On a pair of orthogonal large sets of partitioned incomplete Latin squares

Journal of combinatorial designs (Print), 2022
In this article, we focus on the existence of orthogonal large sets of partitioned incomplete Latin squares (OLSPILS) of type 1pu1 . We prove that there exists an OLSPILS (1pu1) for any prime p≥7 and any odd integer u satisfying 3≤u≤3+2⌊(p−7)∕4⌋ , and ...
Dongliang Li, Cong Shen, Li Wang, H. Cao
semanticscholar   +1 more source

Low delay non-binary error correction codes based on Orthogonal Latin Squares

Integr., 2021
Due to the scaling of technology and the environment effects, such as radiation, memory systems that are on board of spacecraft such as satellites, are more sensitive to errors.
F. García-Herrero, A. Sánchez-Macián, J. A. Maestro   +2 more
semanticscholar   +1 more source

Fast color image encryption scheme based on 3D orthogonal Latin squares and matching matrix

, 2020
To realize real-time image encryption, a fast color image encryption scheme by combining 3D orthogonal Latin squares (3D-OLSs) with matching matrix is proposed.
Jie Zhou, Nanrun Zhou, L. Gong
semanticscholar   +1 more source

Pseudo orthogonal Latin squares

, 2021
Two Latin squares A, B of order n are called pseudo orthogonal if for any 1 ≤ i, j ≤ n there exists a k, 1 ≤ k ≤ n, such that A(i, k) = B(j, k).
S. Faruqi, S. A. Katre, M. Garg
semanticscholar   +1 more source

The enumeration of cyclic mutually nearly orthogonal Latin squares

Journal of combinatorial designs (Print), 2019
In this paper, we study collections of mutually nearly orthogonal Latin squares (MNOLS), which come from a modification of the orthogonality condition for mutually orthogonal Latin squares.
F. Demirkale, D. Donovan, J. Kokkala, T. Marbach   +3 more
semanticscholar   +1 more source

Color image encryption using orthogonal Latin squares and a new 2D chaotic system

Nonlinear dynamics, 2021
Zhongyun Hua, Zhihua Zhu, Yongyong Chen, Yuanman Li   +3 more
semanticscholar   +1 more source

Orthogonal Latin squares-based firefly optimization algorithm for industrial quadratic assignment tasks

Neural computing & applications (Print), 2021
R. M. Rizk-Allah, A. Słowik, A. Darwish, A. Hassanien   +3 more
semanticscholar   +1 more source

Orthogonal Arrays and Latin Squares

, 1999
A. Hedayat, N. Sloane, J. Stufken
semanticscholar   +1 more source