Results 21 to 30 of about 10,083 (180)
Graph design for data authentication over insecure communication channel
Data authentication is a critical issue in communication systems. Based on data authentication techniques, the receiver can affirm that the data is really sent from an authentic sender and it is not a fabricated message from an opponent.
H. Shabana, R. El-Shanawany, S.R. Halawa
doaj +1 more source
Orthogonality for Quantum Latin Isometry Squares [PDF]
Goyeneche et al recently proposed a notion of orthogonality for quantum Latin squares, and showed that orthogonal quantum Latin squares yield quantum codes.
Benjamin Musto, Jamie Vicary
doaj +1 more source
We use integer programming (IP) and constraint programming (CP) to search for sets of mutually orthogonal latin squares (MOLS). We improve the performance of the solvers by formulating an extended symmetry breaking method and provide an alternative CP ...
N. Rubin +3 more
semanticscholar +1 more source
THE CONSTRUCTION AND MAXIMAL SET OF MUTUALLY ORTHOGONAL LATIN SQUARES [PDF]
Given aset of permutation {p1,p2, … . pk} on aset S, we say that the set of permutation is transitive on S if for every ordered pair of elements a,b € S, there exists at least on Pi for which (a) Pi=b.
MAKARIM A. AL-TURKY
doaj +1 more source
QC-LDPC Codes From Difference Matrices and Difference Covering Arrays
We give a framework that generalizes LDPC code constructions using transversal designs or related structures such as mutually orthogonal Latin squares. Our constructions offer a broader range of code lengths and codes rates. Similar earlier constructions
Diane M. Donovan +3 more
doaj +1 more source
Isometry invariant permutation codes and mutually orthogonal Latin squares [PDF]
Commonly, the direct construction and the description of mutually orthogonal Latin squares (MOLS) make use of difference or quasi‐difference matrices. Now there exists a correspondence between MOLS and separable permutation codes.
I. Janiszczak, Reiner Staszewski
semanticscholar +1 more source
More mutually orthogonal latin squares
AbstractWilson's construction for mutually orthogonal Latin squares is generalized. This generalized construction is used to improve known bounds on the function nr (the largest order for which there do not exist r MOLS). In particular we find n7⩽780, n8⩽4738, n9⩽5842, n10⩽7222, n11⩽7478, n12⩽9286, n13⩽9476, n15⩽10632.
Brouwer, A.E., Rees, van, G.H.J.
openaire +2 more sources
Three-way cross designs for animal breeding experiments
Three-way crossbreeding has been a major tool for the development of present day commercial breeds. The hybrids thus produced are more stable and they exhibit individual as well as population buffering mechanism because of the broad genetic base.
MOHD HARUN +3 more
doaj +1 more source
Mutually Orthogonal Latin Squares and Self-complementary Designs [PDF]
Suppose that n is even and a set of n/2 -1 mutually orthogonal Latin squares of order n exists. Then we can construct a strongly regular graph with parameters (n², n/2 (n-1), n/2 ( n/2-1), n/2 ( n/2 -1)), which is called a Latin square graph.
Nakasora, Hiroyuki
core +1 more source
Solution to the Mean King's problem with mutually unbiased bases for arbitrary levels [PDF]
The Mean King's problem with mutually unbiased bases is reconsidered for arbitrary d-level systems. Hayashi, Horibe and Hashimoto [Phys. Rev. A 71, 052331 (2005)] related the problem to the existence of a maximal set of d-1 mutually orthogonal Latin ...
A. S. Holevo +10 more
core +3 more sources

