首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 359 毫秒
1.
There is a one-to-one correspondence between ?-quasi-cyclic codes over a finite field Fq and linear codes over a ring R=Fq[Y]/(Ym?1). Using this correspondence, we prove that every ?-quasi-cyclic self-dual code of length m? over a finite field Fq can be obtained by the building-up construction, provided that char(Fq)=2 or q1(mod4), m is a prime p, and q is a primitive element of Fp. We determine possible weight enumerators of a binary ?-quasi-cyclic self-dual code of length p? (with p a prime) in terms of divisibility by p. We improve the result of Bonnecaze et al. (2003) [3] by constructing new binary cubic (i.e., ?-quasi-cyclic codes of length 3?) optimal self-dual codes of lengths 30,36,42,48 (Type I), 54 and 66. We also find quasi-cyclic optimal self-dual codes of lengths 40, 50, and 60. When m=5, we obtain a new 8-quasi-cyclic self-dual [40,20,12] code over F3 and a new 6-quasi-cyclic self-dual [30,15,10] code over F4. When m=7, we find a new 4-quasi-cyclic self-dual [28,14,9] code over F4 and a new 6-quasi-cyclic self-dual [42,21,12] code over F4.  相似文献   

2.
3.
4.
5.
6.
7.
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.  相似文献   

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

13.
14.
15.
16.
17.
18.
The purpose of this article is to compute the mod 2 cohomology of Γq(K), the mapping class group of the Klein bottle with q marked points. We provide a concrete construction of Eilenberg–MacLane spaces Xq=K(Γq(K),1) and fiber bundles Fq(K)/ΣqXqB(Z2×O(2)), where Fq(K)/Σq denotes the configuration space of unordered q-tuples of distinct points in K and B(Z2×O(2)) is the classifying space of the group Z2×O(2). Moreover, we show the mod 2 Serre spectral sequence of the bundle above collapses.  相似文献   

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

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