scholarly journals Isometry invariant permutation codes and mutually orthogonal Latin squares

2019 ◽  
Vol 27 (9) ◽  
pp. 541-551 ◽  
Author(s):  
Ingo Janiszczak ◽  
Reiner Staszewski
Keyword(s):  
Latin Squares ◽  
Permutation Codes ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares

scholarly journals A Bound on Permutation Codes

10.37236/2929 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Jürgen Bierbrauer ◽  
Klaus Metsch
Keyword(s):  
Projective Plane ◽  
Symmetric Group ◽  
Minimum Distance ◽  
Main Part ◽  
Latin Squares ◽  
Permutation Codes ◽  
Permutation Code ◽  
Mutually Orthogonal Latin Squares ◽  
Hamming Metric ◽  
Completion Theorem

Consider the symmetric group $S_n$ with the Hamming metric. A  permutation code on $n$ symbols is a subset $C\subseteq S_n.$ If $C$ has minimum distance $\geq n-1,$ then $\vert C\vert\leq n^2-n.$ Equality can be reached if and only if a projective plane of order $n$ exists. Call $C$ embeddable if it is contained in a permutation code of minimum distance $n-1$ and cardinality $n^2-n.$ Let $\delta =\delta (C)=n^2-n-\vert C\vert$ be the deficiency of the permutation code $C\subseteq S_n$ of minimum distance $\geq n-1.$We prove that $C$ is embeddable if either $\delta\leq 2$ or if $(\delta^2-1)(\delta +1)^2<27(n+2)/16.$ The main part of the proof is an adaptation of the method used to obtain the famous Bruck completion theorem for mutually orthogonal latin squares.

Projective planes of infinite but isolic order

1976 ◽  
Vol 41 (2) ◽  
pp. 391-404 ◽  
Author(s):  
J. C. E. Dekker
Keyword(s):  
Projective Plane ◽  
Finite Projective Plane ◽  
Projective Planes ◽  
Latin Squares ◽  
Combinatorial Theory ◽  
Ternary Ring ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Planar Ternary Ring ◽  
Partial Recursive Functions

The main purpose of this paper is to show how partial recursive functions and isols can be used to generalize the following three well-known theorems of combinatorial theory.(I) For every finite projective plane Π there is a unique number n such that Π has exactly n2 + n + 1 points and exactly n2 + n + 1 lines.(II) Every finite projective plane of order n can be coordinatized by a finite planar ternary ring of order n. Conversely, every finite planar ternary ring of order n coordinatizes a finite projective plane of order n.(III) There exists a finite projective plane of order n if and only if there exist n − 1 mutually orthogonal Latin squares of order n.

New bounds of Mutually unbiased maximally entangled bases in C^dxC^(kd)

2018 ◽  
Vol 18 (13&14) ◽  
pp. 1152-1164
Author(s):  
Xiaoya Cheng ◽  
Yun Shang
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Prime Power ◽  
Latin Squares ◽  
Mutually Unbiased Bases ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Bipartite System

Mutually unbiased bases which is also maximally entangled bases is called mutually unbiased maximally entangled bases (MUMEBs). We study the construction of MUMEBs in bipartite system. In detail, we construct 2(p^a-1) MUMEBs in \cd by properties of Guss sums for arbitrary odd d. It improves the known lower bound p^a-1 for odd d. Certainly, it also generalizes the lower bound 2(p^a-1) for d being a single prime power. Furthermore, we construct MUMEBs in \ckd for general k\geq 2 and odd d. We get the similar lower bounds as k,b are both single prime powers. Particularly, when k is a square number, by using mutually orthogonal Latin squares, we can construct more MUMEBs in \ckd, and obtain greater lower bounds than reducing the problem into prime power dimension in some cases.

A Partial Generalization of Mann's Theorem Concerning Orthogonal Latin Squares

1988 ◽  
Vol 31 (4) ◽  
pp. 409-413 ◽  
Author(s):  
E. T. Parker ◽  
Lawrence Somer
Keyword(s):  
Latin Square ◽  
Latin Squares ◽  
Necessary Condition ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Complete Set

AbstractLetn = 4t+- 2, where the integert ≧ 2. A necessary condition is given for a particular Latin squareLof ordernto have a complete set ofn — 2mutually orthogonal Latin squares, each orthogonal toL.This condition extends constraints due to Mann concerning the existence of a Latin square orthogonal to a given Latin square.

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.

scholarly journals On seven mutually orthogonal Latin squares

1977 ◽  
Vol 20 ◽  
pp. 193-201 ◽  
Author(s):  
Mieczyslaw Wojtas
Keyword(s):  
Latin Squares ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares

Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares

2004 ◽  
Vol 50 (6) ◽  
pp. 1289-1291 ◽  
Author(s):  
C.J. Colbourn ◽  
T. Klove ◽  
A.C.H. Ling
Keyword(s):  
Latin Squares ◽  
Powerline Communication ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Permutation Arrays

Molecular docking studies of protein-nucleotide complexes using MOLSDOCK (mutually orthogonal Latin squares DOCK)

2012 ◽  
Vol 18 (8) ◽  
pp. 3705-3722 ◽  
Author(s):  
Shankaran Nehru Viji ◽  
Nagarajan Balaji ◽  
Namasivayam Gautham
Keyword(s):  
Molecular Docking ◽  
Docking Studies ◽  
Latin Squares ◽  
Molecular Docking Studies ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares
Sign in / Sign up

Export Citation Format

Share Document