首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
In this note, we demonstrate that every binary doubly even self-dual code of length 40 can be realized as the residue code of some extremal Type II Z4-code. As a consequence, it is shown that there are at least 94356 inequivalent extremal Type II Z4-codes of length 40.  相似文献   

3.
4.
Fen Li  Xiwang Cao 《Discrete Mathematics》2017,340(1):3197-3206
Let Fq be a finite field of odd order q and n=2ap1a1p2a2, where a,a1,a2 are positive integers, p1,p2 are distinct odd primes and 4p1p2|q?1. In this paper, we study the irreducible factorization of xn?1 over Fq and all primitive idempotents in the ring Fq[x]xn?1.Moreover, we obtain the dimensions and the minimum Hamming distances of all irreducible cyclic codes of length n over Fq.  相似文献   

5.
An index ?, length m? quasi-cyclic code can be viewed as a cyclic code of length m over the field Fq? via a basis of the extension Fq?Fq. However, this cyclic code is only linear over Fq, making it an additive cyclic code, or an Fq-linear cyclic code, over the alphabet Fq?. This approach was recently used in Shi et al. (2017) [16] to study a class of quasi-cyclic codes, and more importantly in Shi et al. (2017) [17] to settle a long-standing question on the asymptotic performance of cyclic codes. Here, we answer one of the problems posed in these two articles, and characterize those quasi-cyclic codes which have Fq?-linear cyclic images under a basis of the extension Fq?Fq. Our characterizations are based on the module structure of quasi-cyclic codes, as well as on their CRT decompositions into constituents. In the case of a polynomial basis, we characterize the constituents by using the theory of invariant subspaces of operators. We also observe that analogous results extend to the case of quasi-twisted codes.  相似文献   

6.
7.
8.
9.
10.
11.
12.
《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.  相似文献   

13.
14.
15.
16.
17.
Let q be a power of an odd prime. We prove that all Fq-quadratic perfect nonlinear maps from Fq3 to Fq2 are equivalent. We also give a geometric method to find the corresponding equivalence explicitly.  相似文献   

18.
It is known that each positive definite quasi-Cartan matrix A is Z-equivalent to a Cartan matrix AΔ called Dynkin type of A, the matrix AΔ is uniquely determined up to conjugation by permutation matrices. However, in most of the cases, it is not possible to determine the Dynkin type of a given connected quasi-Cartan matrix by simple inspection. In this paper, we give a graph theoretical characterization of non-symmetric connected quasi-Cartan matrices. For this purpose, a special assemblage of blocks is introduced. This result complements the approach proposed by Barot (1999, 2001), for An, Dn and Em with m=6,7,8.  相似文献   

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

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