共查询到20条相似文献,搜索用时 15 毫秒
1.
In this paper, we give the dimension and the minimum distance of two subclasses of narrow-sense primitive BCH codes over with designed distance for all , where q is a prime power and is a positive integer. As a consequence, we obtain an affirmative answer to two conjectures proposed by C. Ding in 2015. Furthermore, using the previous part, we extend some results of Yue and Hu [16], and we give the dimension and, in some cases, the Bose distance for a large designed distance in the range for , where if m is odd, and if m is even. 相似文献
2.
We consider four classes of polynomials over the fields , , , , , , , where . We find sufficient conditions on the pairs for which these polynomials permute and we give lower bounds on the number of such pairs. 相似文献
3.
4.
Minimal blocking sets in have size at most . This result is due to Bruen and Thas and the bound is sharp, sets attaining this bound are called unitals. In this paper, we show that the second largest minimal blocking sets have size at most , if , , or , , . Our proof also works for sets having at least one tangent at each of its points (that is, for tangency sets). 相似文献
6.
8.
In this paper, we completely determine all necessary and sufficient conditions such that the polynomial , where , is a permutation quadrinomial of over any finite field of odd characteristic. This quadrinomial has been studied first in [25] by Tu, Zeng and Helleseth, later in [24] Tu, Liu and Zeng revisited these quadrinomials and they proposed a more comprehensive characterization of the coefficients that results with new permutation quadrinomials, where and finally, in [16], Li, Qu, Li and Chen proved that the sufficient condition given in [24] is also necessary and thus completed the solution in even characteristic case. In [6] Gupta studied the permutation properties of the polynomial , where and and proposed some new classes of permutation quadrinomials of .In particular, in this paper we classify all permutation polynomials of of the form , where , over all finite fields of odd characteristic and obtain several new classes of such permutation quadrinomials. 相似文献
9.
10.
11.
12.
13.
15.
Let M be a random rank-r matrix over the binary field , and let be its Hamming weight, that is, the number of nonzero entries of M.We prove that, as with r fixed and tending to a constant, we have that converges in distribution to a standard normal random variable. 相似文献
17.
18.
We construct a class of -additive cyclic codes generated by pairs of polynomials, where p is a prime number. Based on probabilistic arguments, we determine the asymptotic rates and relative distances of this class of codes: the asymptotic Gilbert-Varshamov bound at is greater than and the relative distance of the code is convergent to δ, while the rate is convergent to for and . As a consequence, we prove that there exist numerous asymptotically good -additive cyclic codes. 相似文献
19.
Cyclic code is an interesting topic in coding theory and communication systems. In this paper, we investigate the ternary cyclic codes with parameters based on some results proposed by Ding and Helleseth in 2013. Six new classes of optimal ternary cyclic codes are presented by determining the solutions of certain equations over . 相似文献