Top

Designs, Codes and Cryptography

Published in:

21-02-2019

Linked systems of symmetric group divisible designs of type II

Authors: Hadi Kharaghani, Sho Suda

Published in: Designs, Codes and Cryptography | Issue 10/2019

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

Linked systems of symmetric group divisible designs of type II are introduced, and several examples are obtained from affine resolvable designs and a variant of mutually orthogonal Latin squares. Furthermore, an equivalence between such symmetric group divisible designs and some association schemes with 5-classes is provided.

previous article A note on good permutation codes from Reed–Solomon codes

next article Steganographic schemes from perfect codes on Cayley graphs

If \(k=\lambda _1\), then its incidence matrix A satisfies that \(A=\bar{A}\otimes J_n\) for some incidence matrix \(\bar{A}\) of a symmetric design.

In [11] the theorems are valid under the assumption \(k>\lambda _1\). If \(k=\lambda _1\), then linked systems of symmetric group divisible designs are \(A_{i,j}\otimes J_n\) where \(A_{i,j}\)’s are linked systems of symmetric designs.

Bannai E.: Subschemes of some association schemes. J. Algebra 144, 167–188 (1991).MathSciNetCrossRefMATH

Bannai E., Ito T.: Algebraic Combinatorics I: Association Schemes. Benjamin/Cummings, Menlo Park, CA (1984).MATH

Bose R.C.: Symmetric group divisible designs with the dual property. J. Stat. Plan. Inference 1, 87–101 (1977).MathSciNetCrossRefMATH

Colbourn Charles J., Dinitz Jeffrey H. (eds.): Handbook of Combinatorial Designs, 2nd edn, Part IV. Chapman & Hall/CRC, Boca Raton (2006).

van Dam E.: Three-class association schemes. J. Algebraic Comb. 10(1), 69–107 (1999).

van Dam E., Martin W., Muzychuk M.: Uniformity in association schemes and coherent configurations: cometric Q-antipodal schemes and linked systems. J. Comb. Theory Ser. A 120, 1401–1439 (2013).MathSciNetCrossRefMATH

Holzmann W.H., Kharaghani H., Orrick W.: On the Real Unbiased Hadamard Matrices. Combinatorics and Graphs. Contemporary Mathematics, vol. 531, pp. 243–250. American Mathematical Society, Providence, RI (2010).

Holzmann W.H., Kharaghani H., Suda S.: Mutually unbiased biangular vectors and association schemes. In: Colbourn C.J. (ed.) Algebraic Design Theory and Hadamard Matrices, vol. 133, pp. 149–157. Springer Proceedings in Mathematics Statistics. Springer, Berlin (2015).

Ivanov N.V.: Affine planes, ternary rings, and examples of non-Desarguesian planes. arXiv:1604.04945.

Kharaghani H., Sasani S., Suda S.: Mutually unbiased Bush-type Hadamard matrices and association schemes. Electron. J. Comb. 22, \( {\rm {\# }}\)P3.10 (2015).

10.

Kharaghani H., Suda S.: Linked systems of symmetric group divisible designs. J. Algebraic Comb. 47, 319–343 (2017).MathSciNetCrossRefMATH

11.

Kharaghani H., Suda S.: Commutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primes, preprint. arXiv:1709.08150.

12.

Kharaghani H., Suda S.: Disjoint weighing matrices, in preparation.

13.

Kharaghani H., Torabi R.: On a decomposition of complete graphs. Gr. Comb. 19(4), 519–526 (2003).CrossRefMATH

14.

Koukouvinos C.: Some new orthogonal designs in linear regression models. Stat. Probab. Lett. 29(2), 125–129 (1996).MathSciNetCrossRefMATH

15.

LeCompte N., Martin W.J., Owens W.: On the equivalence between real mutually unbiased bases and a certain class of association schemes. Eur. J. Comb. 31, 1499–1512 (2010).MathSciNetCrossRefMATH

16.

Mathon R.: The systems of linked 2-(16,6,2) designs. Ars Comb. 11, 131–148 (1981).MathSciNetMATH

17.

Muzychuk M.E.: V-rings of permutation groups with invariant metric, Ph.D. thesis, Kiev State University (1987).

18.

Qiao Z., Du S.F., Koolen J.H.: \(2\)-Walk regular dihedrants from group divisible designs. Electron. J. Comb. 23, \( {\rm {\# }}\)P2.51 (2016).

19.

Robinson P.J.: Using product designs to construct orthogonal designs. Bull. Aust. Math. Soc. 16, 297–305 (1977).MathSciNetCrossRefMATH

20.

Stinson D.R.: Combinatorial Designs: Constructions and Analysis. Springer, New York (2004).MATH

21.

Wallis W.D.: Construction of strongly regular graphs using affine designs. Bull. Aust. Math. Soc. 4, 41–49 (1971).MathSciNetCrossRefMATH

Title: Linked systems of symmetric group divisible designs of type II
Authors: Hadi Kharaghani
Sho Suda
Publication date: 21-02-2019
Publisher: Springer US
Published in: Designs, Codes and Cryptography / Issue 10/2019
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-019-00622-z

Springer Professional

Linked systems of symmetric group divisible designs of type II

Abstract

Premium Partner

Springer Professional

Abstract

Please log in to get access to your license.

Other articles of this Issue 10/2019

Generalized binary arrays from quasi-orthogonal cocycles

A new construction of zero-difference balanced functions and two applications

Theory of supports for linear codes endowed with the sum-rank metric

On the third greedy weight of 4-dimensional codes

On the weight distribution of second order Reed–Muller codes and their relatives

A note on good permutation codes from Reed–Solomon codes

Premium Partner