共查询到20条相似文献,搜索用时 15 毫秒
1.
We discuss new constructions of Hadamard and conference matrices using relative difference sets. We present the first example of a relative
-difference set where n – 1 is not a prime power. 相似文献
2.
利用Galois环、Bent函数、Gaolis环上的部分指数和等技巧,构造了指数不超过4的有限交换群上的分裂型相对差集和一类非分裂型组合集. 相似文献
3.
Relative Difference Sets with the parameters (2a, 2b, 2a, 2a-b) have been constructed many ways (see davis, EB, jung, maschmidt, and pottsurvey for examples). This paper modifies an example found in arasusehgal to construct a family of relative difference sets in 2-groups that gives examples for b = 2 and b = 3 that have a lower rank than previous examples. The Simplex code is used in the construction. 相似文献
4.
In this paper, we study extensions of trivial difference sets in dihedral groups. Such relative difference sets have parameters
of the form (uλ,u,uλ, λ) or (uλ+2,u, uλ+1, λ) and are called semiregular or affine type, respectively. We show that there exists no nontrivial relative difference
set of affine type in any dihedral group. We also show a connection between semiregular relative difference sets in dihedral
groups and Menon–Hadamard difference sets.
In the last section of the paper, we consider (m, u, k, λ) difference sets of general type in a dihedral group relative to a non-normal subgroup. In particular, we show that if
a dihedral group contains such a difference set, then m is neither a prime power nor product of two distinct primes. 相似文献
5.
In this article, finite p-groups all of whose proper quotient groups are abelian or inner-abelian are classified. As a corollary, finite p-group all of whose proper quotient groups are abelian, and finite p-groups all of whose proper sections are abelian or inner-abelian are also classified. 相似文献
6.
We classify up to isomorphism those finite p-groups,for odd primes p,which contain a cyclic subgroup of index p3. 相似文献
7.
Darryn Bryant Judith Egan Barbara Maenhaut Ian M. Wanless 《Designs, Codes and Cryptography》2009,50(1):93-105
In this paper, we present two constructions of divisible difference sets based on skew Hadamard difference sets. A special
class of Hadamard difference sets, which can be derived from a skew Hadamard difference set and a Paley type regular partial
difference set respectively in two groups of orders v
1 and v
2 with |v
1 − v
2| = 2, is contained in these constructions. Some result on inequivalence of skew Hadamard difference sets is also given in
the paper. As a consequence of Delsarte’s theorem, the dual set of skew Hadamard difference set is also a skew Hadamard difference
set in an abelian group. We show that there are seven pairwisely inequivalent skew Hadamard difference sets in the elementary
abelian group of order 35 or 37, and also at least four pairwisely inequivalent skew Hadamard difference sets in the elementary abelian group of order 39. Furthermore, the skew Hadamard difference sets deduced by Ree-Tits slice symplectic spreads are the dual sets of each other
when q ≤ 311.
相似文献
8.
9.
Zvonimir Janko 《Mathematische Zeitschrift》2006,254(1):29-31
In this note we consider finite noncyclic p-groups G all of whose maximal cyclic subgroups X satisfy one of the following two properties.
(a) If each subgroup H of G containing X properly is nonabelian, then p = 2 and G is generalized quaternion.
(b) If X is contained in exactly one maximal subgroup of G, then G is metacyclic.
This solves the problems Nr.1541 and Nr. 1594 from [1]. 相似文献
10.
For every prime power q 1 (mod 4) we prove the existence of (q; x, y)-partitions of GF(q) with q=x2+4y2 for some x, y, which are very useful for constructing SDS, DS and Hadamard matrices. We discuss the transformations of (q; x,y)-partitions and, by using the partitions, construct generalized cyclotomic classes which have properties similar to those of classical cyclotomic classes. Thus we provide a new construction for Williamson matrices of order q2.The research supported by NSF of China (No. 10071029). 相似文献
11.
12.
John B. Polhill 《Designs, Codes and Cryptography》2002,25(3):299-309
There have been several recent constructions of partial difference sets (PDSs) using the Galois rings
for p a prime and t any positive integer. This paper presents constructions of partial difference sets in
where p is any prime, and r and t are any positive integers. For the case where
2$$
" align="middle" border="0">
many of the partial difference sets are constructed in groups with parameters distinct from other known constructions, and the PDSs are nested. Another construction of Paley partial difference sets is given for the case when p is odd. The constructions make use of character theory and of the structure of the Galois ring
, and in particular, the ring
×
. The paper concludes with some open related problems. 相似文献
13.
New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular, multiplicative and additive DDDS are considered. 相似文献
14.
Finite p-Groups all of Whose Maximal SubgroupsEither are Metacyclic or Have a DerivedSubgroup of Order ≤ p
下载免费PDF全文

The groups as mentioned in the title are classified up to isomorphism. This is an answer to a question proposed by Berkovich and Janko. 相似文献
15.
Cunsheng Ding 《组合设计杂志》2008,16(2):164-171
In this article, two constructions of (v, (v ? 1)/2, (v ? 3)/2) difference families are presented. The first construction produces both cyclic and noncyclic difference families, while the second one gives only cyclic difference families. The parameters of the second construction are new. The difference families presented in this article can be used to construct Hadamard matrices. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 164–171, 2008 相似文献
16.
17.
18.
Christopher N. Swanson 《组合设计杂志》2000,8(6):426-434
A planar cyclic difference packing modulo v is a collection D = {d1, d2,…,dk} of distinct residues modulo v such that any residue α ≢ 0 (mod v) has at most one representation as a difference di − dj (mod v). This paper develops various constructions of such designs and for a fixed positive integer v presents upper and lower bounds on Ψ (v), the maximal number of elements that a planar cyclic difference packing modulo v can contain. This paper also presents the results of calculating Ψ (v) for v ≤ 144, including the fact that 134 is the smallest value of v for which the elementary upper bound of exceeds Ψ (v) by two. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 426–434, 2000 相似文献
19.
Ying-pu Deng Li-feng Guo Mu-lan Liu 《应用数学学报(英文版)》2007,23(1):67-78
In an anonymous secret sharing scheme the secret can be reconstructed without knowledge ofwhich participants hold which shares.In this paper some constructions of anonymous secret sharing schemeswith 2 thresholds by using combinatorial designs are given.Let v(t,w,q)denote the minimum size of the setof shares of a perfect anonymous(t,w)threshold secret sharing scheme with q secrets.In this paper we provethat v(t,w,q)=(q)if t and w are fixed and that the lower bound of the size of the set of shares in[4]is notoptimal under certain condition. 相似文献
20.
In this article a class of subgroups of a finite group G, called Q-injectors, is introduced. If G is soluble, the Q-injectors are precisely the injectors of the Fitting sets. A characterization of nilpotent Q-injectors is given as well as a sufficient condition for the solubility of a finite group G, in terms of Q-injectors, which generalizes a well known result. 相似文献