Abstract
Several new constructions for difference matrices are given. One classof constructions uses pairwise balanced designs to develop newdifference matrices over the additive group of GF (q). A second class of constructions gives difference matrices overgroups whose orders are not (necessarily) prime powers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. J. R. Abel and Y. W. Cheng, Some new MOLS of order 2 n p for p a prime power, Austral. J. Combin., 10 (1994) pp. 175–186.
T. Beth, D. Jungnickel, and H. Lenz, Design Theory, Cambridge University Press (1986).
W. de Launey, A survey of generalized Hadamard matrices and difference matrices D (k, λ; G) with large k, Util. Math., 30 (1986) pp. 5–29.
W. de Launey, On difference matrices, transversal designs, resolvable transversal designs, and large sets of mutually orthogonal F-squares, J. Stat. Plan. Infer., 16 (1987) pp. 107–125.
S. Furino, Existence results for near resolvable designs, J. Comb. Designs, 3 (1995) pp. 101–113.
A. S. Hedayat, N. J. A. Sloane, and J. Stufken, Orthogonal Arrays, to appear.
D. Jungnickel, On difference matrices, resolvable transversal designs and generalized Hadamard matrices, Math. Z., 167 (1979) pp. 49–60.
R. Mathon and A. Rosa, Tables of parameters of BIBDs with r · 41 including Existence, Enumeration, and Resolvability Results, Ann. Disc. Math., 26 (1985) pp. 275–308.
S. S. Shrikhande, Generalized Hadamard matrices and orthogonal arrays of strength 2, Canad. J. Math.,16 (1964) pp. 131–141.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Colbourn, C.J., Kreher, D.L. Concerning Difference Matrices. Designs, Codes and Cryptography 9, 61–70 (1996). https://doi.org/10.1023/A:1027389907339
Issue date:
DOI: https://doi.org/10.1023/A:1027389907339