Skip to main content
Top
Published in: Designs, Codes and Cryptography 1/2018

21-01-2017

Mosaics of combinatorial designs

Authors: Oliver Wilhelm Gnilke, Marcus Greferath, Mario Osvin Pavčević

Published in: Designs, Codes and Cryptography | Issue 1/2018

Login to get access

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

search-config
loading …

Abstract

Looking at incidence matrices of t-\((v,\,k,\,\lambda )\) designs as \(v \times b\) matrices with two possible entries, each of which indicates incidences of a t-design, we introduce the notion of a c-mosaic of designs, having the same number of points and blocks, as a matrix with c different entries, such that each entry defines incidences of a design. In fact, a \(v \times b\) matrix is decomposed in c incidence matrices of designs, each denoted by a different colour, hence this decomposition might be seen as a tiling of a matrix with incidence matrices of designs as well. These mosaics have applications in experiment design when considering a simultaneous run of several different experiments. We have constructed infinite series of examples of mosaics and state some probably non-trivial open problems. Furthermore we extend our definition to the case of q-analogues of designs in a meaningful way.
Literature
1.
go back to reference Braun M., Etzion T., Östergård P.R.J., Vardy A., Wassermann A.: Existence of \(q\)-analogs of Steiner systems. Forum Math. Pi (2016). doi:10.1017/fmp.2016.5. Braun M., Etzion T., Östergård P.R.J., Vardy A., Wassermann A.: Existence of \(q\)-analogs of Steiner systems. Forum Math. Pi (2016). doi:10.​1017/​fmp.​2016.​5.
2.
go back to reference Ćustić A., Krčadinac V., Zhou Y.: Tiling groups with difference sets. Electron. J. Comb. 22(2), 2–56 (2015).MathSciNetMATH Ćustić A., Krčadinac V., Zhou Y.: Tiling groups with difference sets. Electron. J. Comb. 22(2), 2–56 (2015).MathSciNetMATH
4.
go back to reference Fisher R.A.: An examination of the different possible solutions of a problem in incomplete blocks. Ann. Eugen. 10(1), 52–75 (1940).MathSciNetCrossRef Fisher R.A.: An examination of the different possible solutions of a problem in incomplete blocks. Ann. Eugen. 10(1), 52–75 (1940).MathSciNetCrossRef
6.
go back to reference Hou F., Cai L., Shen X., Huang J.: Asynchronous multichannel MAC design with difference-set-based hopping sequences. IEEE Trans. Veh. Technol. 60(4), 1728–1739 (2011).CrossRef Hou F., Cai L., Shen X., Huang J.: Asynchronous multichannel MAC design with difference-set-based hopping sequences. IEEE Trans. Veh. Technol. 60(4), 1728–1739 (2011).CrossRef
8.
go back to reference Krčadinac V., Nakić A., Pavčević M.O.: Equations for coefficients of tactical decomposition matrices for \(t\)-designs. Des. Codes Cryptogr. 72, 465–469 (2014).MathSciNetCrossRefMATH Krčadinac V., Nakić A., Pavčević M.O.: Equations for coefficients of tactical decomposition matrices for \(t\)-designs. Des. Codes Cryptogr. 72, 465–469 (2014).MathSciNetCrossRefMATH
10.
go back to reference Silberstein N., Etzion T.: Optimal fractional repetition codes for distributed storage systems. In: 2014 IEEE 28th Convention of Electrical and Electronics Engineers in Israel (IEEEI), pp. 1–4 (2014). Silberstein N., Etzion T.: Optimal fractional repetition codes for distributed storage systems. In: 2014 IEEE 28th Convention of Electrical and Electronics Engineers in Israel (IEEEI), pp. 1–4 (2014).
Metadata
Title
Mosaics of combinatorial designs
Authors
Oliver Wilhelm Gnilke
Marcus Greferath
Mario Osvin Pavčević
Publication date
21-01-2017
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 1/2018
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-017-0328-6

Other articles of this Issue 1/2018

Designs, Codes and Cryptography 1/2018 Go to the issue

Premium Partner