首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let Fq be the finite field of characteristic p with q elements and Fqn its extension of degree n. We prove that there exists a primitive element of Fqn that produces a completely normal basis of Fqn over Fq, provided that n=p?m with (m,p)=1 and q>m.  相似文献   

2.
3.
4.
Let Fq be the finite field of order q. Let G be one of the three groups GL(n,Fq), SL(n,Fq) or U(n,Fq) and let W be the standard n-dimensional representation of G. For non-negative integers m and d we let mWdW? denote the representation of G given by the direct sum of m vectors and d covectors. We exhibit a minimal set of homogeneous invariant polynomials {?1,?2,,?(m+d)n}?Fq[mWdW?]G such that Fq(mWdW?)G=Fq(?1,?2,,?(m+d)n) for all cases except when md=0 and G=GL(n,Fq) or SL(n,Fq).  相似文献   

5.
《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.  相似文献   

6.
7.
Let q be a perfect power of a prime number p and E(Fq) be an elliptic curve over Fq given by the equation y2=x3+Ax+B. For a positive integer n we denote by #E(Fqn) the number of rational points on E (including infinity) over the extension Fqn. Under a mild technical condition, we show that the sequence {#E(Fqn)}n>0 contains at most 10200 perfect squares. If the mild condition is not satisfied, then #E(Fqn) is a perfect square for infinitely many n including all the multiples of 12. Our proof uses a quantitative version of the Subspace Theorem. We also find all the perfect squares for all such sequences in the range q<50 and n1000.  相似文献   

8.
9.
10.
Huffman (2013) [12] studied Fq-linear codes over Fqm and he proved the MacWilliams identity for these codes with respect to ordinary and Hermitian trace inner products. Let S be a finite commutative Fq-algebra. An Fq-linear code over S of length n is an Fq-submodule of Sn. In this paper, we study Fq-linear codes over S. We obtain some bounds on minimum distance of these codes, and some large classes of MDR codes are introduced. We generalize the ordinary and Hermitian trace products over Fq-algebras and we prove the MacWilliams identity with respect to the generalized form. In particular, we obtain Huffman's results on the MacWilliams identity. Among other results, we give a theory to construct a class of quantum codes and the structure of Fq-linear codes over finite commutative graded Fq-algebras.  相似文献   

11.
Linearized polynomials have attracted a lot of attention because of their applications in both geometric and algebraic areas. Let q be a prime power, n be a positive integer and σ be a generator of Gal(Fqn:Fq). In this paper we provide closed formulas for the coefficients of a σ-trinomial f over Fqn which ensure that the dimension of the kernel of f equals its σ-degree, that is linearized polynomials with maximum kernel. As a consequence, we present explicit examples of linearized trinomials with maximum kernel and characterize those having σ-degree 3 and 4. Our techniques rely on the tools developed in [24]. Finally, we apply these results to investigate a class of rank metric codes introduced in [8], to construct quasi-subfield polynomials and cyclic subspace codes, obtaining new explicit constructions to the conjecture posed in [37].  相似文献   

12.
13.
14.
15.
Let Fq be the finite field with q elements, and T a positive integer. In this article, we find an asymptotic formula for the total number of monic irreducible binomials in Fq[x] of degree less or equal to T, when T is large enough. We also show explicit lower and upper bounds for the number of binomials in the case when T is small.  相似文献   

16.
We construct invariant polynomials on truncated multicurrent algebras, which are Lie algebras of the form g?FF[t1,,t?]/I, where g is a finite-dimensional Lie algebra over a field F of characteristic zero, and I is a finite-codimensional ideal of F[t1,,t?] generated by monomials. In particular, when g is semisimple and F is algebraically closed, we construct a set of algebraically independent generators for the algebra of invariant polynomials. In addition, we describe a transversal slice to the space of regular orbits in g?FF[t1,,t?]/I. As an application of our main result, we show that the center of the universal enveloping algebra of g?FF[t1,,t?]/I acts trivially on all irreducible finite-dimensional representations provided I has codimension at least two.  相似文献   

17.
18.
19.
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).  相似文献   

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

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