Results 261 to 270 of about 49,866 (307)
Some of the next articles are maybe not open access.
Journal of Applied Mathematics and Computing, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iranmanesh, A., Ashrafi, A. R.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iranmanesh, A., Ashrafi, A. R.
openaire +1 more source
Approximating Latin Square Extensions
Algorithmica, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kumar, S. R., Russell, A., Sundaram, R.
openaire +1 more source
Latin Squares, Partial Latin Squares and Their Generalized Quotients
Graphs and Combinatorics, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu, Glebsky L., Rubio, Carlos J.
openaire +1 more source
Orthogonal latin square graphs
Journal of Graph Theory, 1979AbstractAn orthogonal latin square graph (OLSG) is one in which the vertices are latin squares of the same order and on the same symbols, and two vertices are adjacent if and only if the latin squares are orthogonal. If G is an arbitrary finite graph, we say that G is realizable as an OLSG if there is an OLSG isomorphic to G. The spectrum of G [Spec(G)]
Lindner, Charles C. +3 more
openaire +1 more source
IBM Journal of Research and Development, 1970
A new class of multiple-error correcting codes has been developed. Since it belongs to the class of one-step-decodable majority codes, it can be decoded at an exceptionally high speed. This class of codes is derived from a set of mutually orthogonal Latin squares.
Hsiao, M. Y. +2 more
openaire +1 more source
A new class of multiple-error correcting codes has been developed. Since it belongs to the class of one-step-decodable majority codes, it can be decoded at an exceptionally high speed. This class of codes is derived from a set of mutually orthogonal Latin squares.
Hsiao, M. Y. +2 more
openaire +1 more source
Latin Squares over Quasigroups
Lobachevskii Journal of Mathematics, 2020In this paper, the authors describe a constructive way for generating finite quasigroups of any given order that generalizes a previous method defined in [\textit{V. A. Nosov} and \textit{A. E. Pankratiev}, J. Math. Sci., New York 149, No. 3, 1230--1234 (2008; Zbl 1146.05011); translation from Fundam. Prikl. Mat. 12, No. 3, 65--71 (2006)].
Galatenko, A. V. +2 more
openaire +1 more source
Resonance, 2012
In this article we discuss MacNeish’s extension of Euler’s conjecture on orthogonal Latin squares, and how these conjectures were disposedoff.
openaire +1 more source
In this article we discuss MacNeish’s extension of Euler’s conjecture on orthogonal Latin squares, and how these conjectures were disposedoff.
openaire +1 more source
IEEE Transactions on Electronic Computers, 1963
Minnick, R. C., Elspas, B., Short, R. A.
openaire +1 more source
Minnick, R. C., Elspas, B., Short, R. A.
openaire +1 more source
Design and application of an S-box using complete Latin square
Nonlinear Dynamics, 2021Zhongyun Hua, Jiaxin Li, yongyong Chen
exaly