首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 93 毫秒
1.
The ZpZp2-additive codes are subgroups of Zpα1×Zp2α2, and can be seen as linear codes over Zp when α2=0, Zp2-additive codes when α1=0, or Z2Z4-additive codes when p=2. A ZpZp2-linear generalized Hadamard (GH) code is a GH code over Zp which is the Gray map image of a ZpZp2-additive code. Recursive constructions of ZpZp2-additive GH codes of type (α1,α2;t1,t2) with t1,t21 are known. In this paper, we generalize some known results for ZpZp2-linear GH codes with p=2 to any p3 prime when α10, and then we compare them with the ones obtained when α1=0. First, we show for which types the corresponding ZpZp2-linear GH codes are nonlinear over Zp. Then, for these codes, we compute the kernel and its dimension, which allow us to classify them completely. Moreover, by computing the rank of some of these codes, we show that, unlike Z4-linear Hadamard codes, the Zp2-linear GH codes are not included in the family of ZpZp2-linear GH codes with α10 when p3 prime. Indeed, there are some families with infinite nonlinear ZpZp2-linear GH codes, where the codes are not equivalent to any Zps-linear GH code with s2.  相似文献   

2.
《Discrete Mathematics》2022,345(11):113059
Let Fq be the finite field of q elements and let D2n=x,y|xn=1,y2=1,yxy=xn?1 be the dihedral group of 2n elements. Left ideals of the group algebra Fq[D2n] are known as left dihedral codes over Fq of length 2n, and abbreviated as left D2n-codes. Let gcd(n,q)=1. In this paper, we give an explicit representation for the Euclidean hull of every left D2n-code over Fq. On this basis, we determine all distinct Euclidean LCD codes and Euclidean self-orthogonal codes which are left D2n-codes over Fq. In particular, we provide an explicit representation and a precise enumeration for these two subclasses of left D2n-codes and self-dual left D2n-codes, respectively. Moreover, we give a direct and simple method for determining the encoder (generator matrix) of any left D2n-code over Fq, and present several numerical examples to illustrative our applications.  相似文献   

3.
4.
5.
《Discrete Mathematics》2020,343(3):111721
The Z2s-additive codes are subgroups of Z2sn, and can be seen as a generalization of linear codes over Z2 and Z4. A Z2s-linear Hadamard code is a binary Hadamard code which is the Gray map image of a Z2s-additive code. A partial classification of these codes by using the dimension of the kernel is known. In this paper, we establish that some Z2s-linear Hadamard codes of length 2t are equivalent, once t is fixed. This allows us to improve the known upper bounds for the number of such nonequivalent codes. Moreover, up to t=11, this new upper bound coincides with a known lower bound (based on the rank and dimension of the kernel). Finally, when we focus on s{2,3}, the full classification of the Z2s-linear Hadamard codes of length 2t is established by giving the exact number of such codes.  相似文献   

6.
7.
8.
We explicitly determine generators of cyclic codes over a non-Galois finite chain ring Zp[u]/u3 of length pk, where p is a prime number and k is a positive integer. We completely classify that there are three types of principal ideals of Zp[u]/u3 and four types of non-principal ideals of Zp[u]/u3, which are associated with cyclic codes over Zp[u]/u3 of length pk. We then obtain a mass formula for cyclic codes over Zp[u]/u3 of length pk.  相似文献   

9.
10.
11.
12.
I. Hambleton, L. Taylor and B. Williams conjectured a general formula in the spirit of H. Lenstra for the decomposition of Gn(RG) for any finite group G and noetherian ring R. The conjectured decomposition was shown to hold for some large classes of finite groups. D. Webb and D. Yao discovered that the conjecture failed for the symmetric group S5, but remarked that it still might be reasonable to expect the HTW-decomposition for solvable groups. In this paper we show that the solvable group SL(2,F3) is also a counterexample to the conjectured HTW-decomposition. Nevertheless, we prove that for any finite group G the rank of G1(ZG) does not exceed the rank of the expression in the HTW-decomposition. We also show that the HTW-decomposition predicts correct torsion for G1(ZG) for any finite group G. Furthermore, we prove that for any degree other than n=1 the conjecture gives a correct prediction for the rank of Gn(ZG).  相似文献   

13.
14.
We show that the construction of Gabor frames in L2(R) with generators in S0(R) and with respect to time-frequency shifts from a rectangular lattice αZ×βZ is equivalent to the construction of certain Gabor frames for L2 over the adeles over the rationals and the group R×Qp. Furthermore, we detail the connection between the construction of Gabor frames on the adeles and on R×Qp with the construction of certain Heisenberg modules.  相似文献   

15.
Let p be an odd prime number. We describe the Whitehead group of all extra-special and almost extra-special p-groups. For this we compute, for any finite p-group P, the subgroup Cl1(ZP) of SK1(ZP), in terms of a genetic basis of P. We also introduce a deflation map Cl1(ZP)Cl1(Z(P/N)), for a normal subgroup N of P, and show that it is always surjective. Along the way, we give a new proof of the result describing the structure of SK1(ZP), when P is an elementary abelian p-group.  相似文献   

16.
Let F2m be a finite field of cardinality 2m, R=F2m[u]u4=F2m+uF2m+u2F2m+u3F2m (u4=0) which is a finite chain ring, and n is an odd positive integer. For any δ,αF2m×, an explicit representation for the dual code of any (δ+αu2)-constacyclic code over R of length 2n is given. And some dual codes of (1+u2)-constacyclic codes over R of length 14 are constructed. For the case of δ=1, all distinct self-dual (1+αu2)-constacyclic codes over R of length 2n are determined.  相似文献   

17.
In the Constrained-degree percolation model on a graph (V,E) there are a sequence, (Ue)eE, of i.i.d. random variables with distribution U[0,1] and a positive integer k. Each bond e tries to open at time Ue, it succeeds if both its end-vertices would have degrees at most k1. We prove a phase transition theorem for this model on the square lattice L2, as well as on the d-ary regular tree. We also prove that on the square lattice the infinite cluster is unique in the supercritical phase.  相似文献   

18.
The notion of multiple Ore extension is introduced as a natural generalization of Ore extensions and double Ore extensions. For a PBW-deformation Bq(sl(n+1,C)) of type An quantum group, we explicitly obtain the commutation relations of its root vectors, then show that it can be realized via a series of multiple Ore extensions, which we call a ladder Ore extension of type (1,2,?,n). Moreover, we analyze the quantum algebras Bq(g) with g of type D4, B2 and G2 and give some examples and counterexamples that can be realized by a ladder Ore extension.  相似文献   

19.
《Discrete Mathematics》2023,346(1):113126
New s-extremal extremal unimodular lattices in dimensions 38, 40, 42 and 44 are constructed from self-dual codes over F5 by Construction A. In the process of constructing these codes, we obtain a self-dual [44,22,14] code over F5. In addition, the code implies a [43,22,13] code over F5. These codes have larger minimum weights than the previously known [44,22] codes and [43,22] codes, respectively.  相似文献   

20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号