共查询到20条相似文献,搜索用时 15 毫秒
1.
A Menon design of order h2 is a symmetric (4h2,2h2‐h,h2‐h)‐design. Quasi‐residual and quasi‐derived designs of a Menon design have parameters 2‐(2h2 + h,h2,h2‐h) and 2‐(2h2‐h,h2‐h,h2‐h‐1), respectively. In this article, regular Hadamard matrices are used to construct non‐embeddable quasi‐residual and quasi‐derived Menon designs. As applications, we construct the first two new infinite families of non‐embeddable quasi‐residual and quasi‐derived Menon designs. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 53–62, 2009 相似文献
2.
We propose a technique for constructing two infinite families of non‐embeddable quasi‐residual designs as soon as one such design satisfying certain conditions exists. The main tools are generalized Hadamard matrices and balanced generalized weighing matrices. Starting with a specific non‐embeddable quasi‐residual 2‐(27,9,4) design, we construct for every positive integer m a non‐embeddable 2‐(3m,3m?1,(3m?1?1)/2)‐design, and, if rm=(3m?1)/2 is a prime power, we construct for every positive integer n a non‐embeddable design. For each design in these families, a symmetric design with the corresponding parameters is known to exist. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 160–172, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.900 相似文献
3.
We consider Hadamard matrices with the quasi-3 property, and their implications for the existence of certain quasi-symmetric designs. We find necessary conditions on the parameters, and show that the quasi-3 property is preserved by the Kronecker product. 相似文献
4.
Ivan N. Landgev 《Designs, Codes and Cryptography》1996,8(3):309-318
In this paper we present constructions for group divisible designs from generalized partial difference matrices. We describe some classes of examples. 相似文献
5.
We introduce a recursive construction of regular Handamard matrices with row sum 2h for h=±3n. Whenever q=(2h – 1)2 is a prime power, we construct, for every positive integer m, a symmetric designs with parameters (4h2(qm+1 – 1)/(q – 1), (2h2 – h)qm, (h2 – h)qm). 相似文献
6.
Tariq Alraqad 《组合设计杂志》2008,16(4):263-275
The main result in this article is a method of constructing a non‐embeddable quasi‐derived design from a quasi‐derived design and an α‐resolvable design. This method is a generalization of techniques used by van Lint and Tonchev in 14 , 15 and Kageyama and Miao in 8 . As applications, we construct several new families of non‐embeddable quasi‐derived designs. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 263–275, 2008 相似文献
7.
Yu Qing Chen 《组合设计杂志》2008,16(5):431-441
In this article, we introduce what we call twisted Kronecker products of cocycles of finite groups and show that the twisted Kronecker product of two cocycles is a Hadamard cocycle if and only if the two cocycles themselves are Hadamard cocycles. This enables us to generalize some known results concerning products and factorizations of central semi‐regular relative difference sets. © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 431–441, 2008 相似文献
8.
In this paper, we investigate Hadamard matrices of order 2(p + 1) with an automorphism of odd prime order p. In particular, the classification of such Hadamard matrices for the cases p = 19 and 23 is given. Self‐dual codes related to such Hadamard matrices are also investigated. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 367–380, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10052 相似文献
9.
《组合设计杂志》2018,26(8):401-411
We introduce the notion of quasi‐orthogonal cocycle. This is motivated in part by the maximal determinant problem for square ‐matrices of size congruent to 2 modulo 4. Quasi‐orthogonal cocycles are analogous to the orthogonal cocycles of algebraic design theory. Equivalences with new and known combinatorial objects afforded by this analogy, such as quasi‐Hadamard groups, relative quasi‐difference sets, and certain partially balanced incomplete block designs, are proved. 相似文献
10.
John C. Galati 《组合设计杂志》2004,12(4):279-298
A new approach to (normal) relative difference sets (RDSs) is presented and applied to give a new method for recursively constructing infinite families of semiregular RDSs. Our main result (Theorem 7.1) shows that any metabelian semiregular RDS gives rise to an infinite family of metabelian semiregular RDSs. The new method is applied to identify several new infinite families of non‐abelian semiregular RDSs, and new methods for constructing generalized Hadamard matrices are given. The techniques employed are derived from the general theory of group extensions. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 279–298, 2004. 相似文献
11.
The symmetric class-regular (4,4)-nets having a group of bitranslations G of order four are enumerated up to isomorphism. There are 226 nets with , and 13 nets with . Using a (4,4)-net with full automorphism group of smallest order, the lower bound on the number of pairwise non-isomorphic affine 2-(64,16,5) designs is improved to 21,621,600. The classification of class-regular (4,4)-nets implies the classification of all generalized Hadamard matrices (or difference matrices) of order 16 over a group of order four up to monomial equivalence. The binary linear codes spanned by the incidence matrices of the nets, as well as the quaternary and -codes spanned by the generalized Hadamard matrices are computed and classified. The binary codes include the affine geometry [64,16,16] code spanned by the planes in AG(3,4) and two other inequivalent codes with the same weight distribution.These codes support non-isomorphic affine 2-(64,16,5) designs that have the same 2-rank as the classical affine design in AG(3,4), hence provide counter-examples to Hamadas conjecture. Many of the -codes spanned by generalized Hadamard matrices are self-orthogonal with respect to the Hermitian inner product and yield quantum error-correcting codes, including some codes with optimal parameters.Vladimir D. Tonchev-Research of this author sponsored by the National Security Agency under Grant MDA904-03-1-0088.classification 5B, 51E, 94B 相似文献
12.
Divisible design digraphs are constructed from skew balanced generalized weighing matrices and generalized Hadamard matrices. Commutative and non-commutative association schemes are shown to be attached to the constructed divisible design digraphs. 相似文献
13.
T. S. Michael 《组合设计杂志》2006,14(1):41-51
What is the minimum order of a Hadamard matrix that contains an a by b submatrix of all 1's? Newman showed that where c? denotes the smallest order greater than or equal to c for which a Hadamard matrix exists. It follows that if 4 divides both a and b, and if the Hadamard conjecture is true, then . We establish the improved bounds for min {a,b} ≥ 2. The Hadamard conjecture therefore implies that if 4 divides both 2ab and ?a/2? ?b/2?, then (a, b) = 2 · max {?a/2?b, ?b/2?a}. Our lower bound comes from a counting argument, while our upper bound follows from a sub‐multiplicative property of : Improvements in our upper bound occur when suitable conference matrices or Bush‐type Hadamard matrices exist. We conjecture that any (1,?1)‐matrix of size a by b occurs as a submatrix of some Hadamard matrix of order at most . © 2005 Wiley Periodicals, Inc. J Combin Designs 相似文献
14.
We present the full classification of Hadamard 2-(31,15,7), Hadamard 2-(35, 17,8) and Menon 2-(36,15,6) designs with automorphisms
of odd prime order. We also give partial classifications of such designs with automorphisms of order 2. These classifications
lead to related Hadamard matrices and self-dual codes. We found 76166 Hadamard matrices of order 32 and 38332 Hadamard matrices
of order 36, arising from the classified designs. Remarkably, all constructed Hadamard matrices of order 36 are Hadamard equivalent
to a regular Hadamard matrix. From our constructed designs, we obtained 37352 doubly-even [72,36,12] codes, which are the
best known self-dual codes of this length until now.
相似文献
15.
It is known that all doubly‐even self‐dual codes of lengths 8 or 16, and the extended Golay code, can be constructed from some binary Hadamard matrix of orders 8, 16, and 24, respectively. In this note, we demonstrate that every extremal doubly‐even self‐dual [32,16,8] code can be constructed from some binary Hadamard matrix of order 32. © 2004 Wiley Periodicals, Inc. 相似文献
16.
Harold N. Ward 《组合设计杂志》2012,20(7):328-331
This note provides a correction and some additions to a 1999 article by Luigia Berardi and Fulvio Zuanni on blocking 3‐sets in designs. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 328–331, 2012 相似文献
17.
In this paper, three new direct Mutually Orthogonal Latin Squares (MOLS) constructions are presented for 7 MOLS(24), 7 MOLS(75) and 8 MOLS(36); then using recursive methods, several new constructions for 7 and 8 MOLS are obtained. These reduce the largest value for which 7 MOLS are unknown from 780 to 570, and the largest odd value for which 8 MOLS are unknown from 1935 to 419. © 2003 Wiley Periodicals, Inc. 相似文献
18.
19.
R. Craigen 《Discrete Mathematics》2008,308(13):2868-2884
We introduce power Hadamard matrices, in order to study the structure of (group) generalized Hadamard matrices, Butson (generalized) Hadamard matrices and other related orthogonal matrices, with which they share certain common characteristics. The new objects turn out to be as interesting, and perhaps as useful, as the objects that motivated them.We develop a basic theory of power Hadamard matrices, explore these relationships, and offer some new insights into old results. For example, we show that all 4×4 Butson Hadamard matrices are equivalent to circulant ones, and how to move between equivalence classes.We provide, among other new things, an infinite family of circulant Butson Hadamard matrices that extends a known class to include one of each positive integer order.Dedication: In 1974 Jennifer Seberry (Wallis) introduced what was then a totally new structure, orthogonal designs, in order to study the existence and construction of Hadamard matrices. They have proved their worth for this purpose, and have also become an object of interest for their own sake and in applications (e.g., [H.J.V. Tarok, A.R. Calderbank, Space-time block codes from orthogonal designs, IEEE Trans. Inf. Theory 45 (1999) 1456-1467. [26]]). Since then many other generalizations of Hadamard matrices have been introduced, including some discussed herein. In the same spirit we introduce a new object showing this kind of promise.Seberry's contributions to this field are not limited to her own work, of which orthogonal designs are but one example—she has mentored many young mathematicians who have expanded her legacy by making their own marks in this field. It is fitting, therefore, that our contribution to this volume is a collaboration between one who has worked in this field for over a decade and an undergraduate student who had just completed his third year of study at the time of the work. 相似文献
20.