共查询到20条相似文献,搜索用时 31 毫秒
1.
Huffman (2013) [12] studied -linear codes over and he proved the MacWilliams identity for these codes with respect to ordinary and Hermitian trace inner products. Let S be a finite commutative -algebra. An -linear code over S of length n is an -submodule of . In this paper, we study -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 -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 -linear codes over finite commutative graded -algebras. 相似文献
2.
Let be the finite field of characteristic p with q elements and its extension of degree n. We prove that there exists a primitive element of that produces a completely normal basis of over , provided that with and . 相似文献
3.
4.
5.
6.
7.
We consider a generalisation of a conjecture by Patterson and Wiedemann from 1983 on the Hamming distance of a function from to to the set of affine functions from to . We prove the conjecture for each q such that the characteristic of lies in a subset of the primes with density 1 and we prove the conjecture for all q by assuming the generalised Riemann hypothesis. Roughly speaking, we show the existence of functions for which the distance to the affine functions is maximised when n tends to infinity. This also determines the asymptotic behaviour of the covering radius of the Reed-Muller code over and so answers a question raised by Leducq in 2013. Our results extend the case , which was recently proved by the author and which corresponds to the original conjecture by Patterson and Wiedemann. Our proof combines evaluations of Gauss sums in the semiprimitive case, probabilistic arguments, and methods from discrepancy theory. 相似文献
8.
9.
10.
Let q be a perfect power of a prime number p and be an elliptic curve over given by the equation . For a positive integer n we denote by the number of rational points on E (including infinity) over the extension . Under a mild technical condition, we show that the sequence contains at most 10200 perfect squares. If the mild condition is not satisfied, then 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 and . 相似文献
11.
We present several existence and nonexistence results for permutation binomials of the form , where and . As a consequence, we obtain a complete characterization of such permutation binomials over , , , , and , where p is an odd prime. 相似文献
12.
13.
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 . In this paper we provide closed formulas for the coefficients of a σ-trinomial f over 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]. 相似文献
14.
16.
17.
18.
《Indagationes Mathematicae》2023,34(3):643-659
We give an asymptotic formula for the number of sublattices of index at most for which has rank at most , answering a question of Nguyen and Shparlinski. We compare this result to work of Stanley and Wang on Smith normal forms of random integral matrices and discuss connections to the Cohen–Lenstra heuristics. Our arguments are based on Petrogradsky’s formulas for the cotype zeta function of , a multivariable generalization of the subgroup growth zeta function of . 相似文献
19.
20.
Hai Q. Dinh Xiaoqiang Wang Hongwei Liu Songsak Sriboonchitta 《Discrete Mathematics》2019,342(11):3062-3078
Let be an odd prime, and be a nonzero element of the finite field . The -constacyclic codes of length over are classified as the ideals of quotient ring in terms of their generator polynomials. Based on these generator polynomials, the symbol-pair distances of all such -constacyclic codes of length are obtained in this paper. As an application, all MDS symbol-pair constacyclic codes of length over are established, which produce many new MDS symbol-pair codes with good parameters. 相似文献