Group divisible designs in MOLS of order ten

The maximum number of mutually orthogonal latin squares (MOLS) of order 10 is known to be between 2 and 6. A hypothetical set of four MOLS must contain at least one of the types of group divisible designs (GDDs) classified here. The proof is based on a dimension argument modified from work by Doughe...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Designs, codes, and cryptography Ročník 71; číslo 2; s. 283 - 291
Hlavní autoři:	Dukes, Peter, Howard, Leah
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.05.2014 Springer
Témata:	Circuits Coding and Information Theory Combinatorics Combinatorics. Ordered structures Computer Science Cryptology Data Structures and Information Theory Designs and configurations Discrete Mathematics in Computer Science Exact sciences and technology Geometry Group theory Group theory and generalizations Information and Communication Mathematics Sciences and techniques of general use GDD Dimension Net Primary 05B15 Code MOLS Secondary 51E14 Orthogonal array Incidence geometry Latin square Group divisible design Symmetry group Block design Classification
ISSN:	0925-1022, 1573-7586
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!