共查询到20条相似文献,搜索用时 546 毫秒
1.
2.
3.
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. 相似文献
4.
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. 相似文献
5.
《Discrete Mathematics》2022,345(9):112970
7.
8.
After a brief review of the existing results on permutation binomials of finite fields, we introduce the notion of equivalence among permutation binomials (PBs) and describe how to bring a PB to its canonical form under equivalence. We then focus on PBs of of the form , where n and d are positive integers and . Our contributions include two nonexistence results: (1) If q is even and sufficiently large and , then is not a PB of . (2) If , q is sufficiently large and , then is not a PB of under certain additional conditions. (1) partially confirms a recent conjecture by Tu et al. (2) is an extension of a previous result with . 相似文献
10.
Let GP be the m-Paley graph defined on the finite field with order . We study eigenfunctions and maximal cliques in generalised Paley graphs GP , where . In particular, we explicitly construct maximal cliques of size or in GP , and show the weight-distribution bound on the cardinality of the support of an eigenfunction is tight for the smallest eigenvalue of GP . These new results extend the work of Baker et al. and Goryainov et al. on Paley graphs of square order. We also study the stability of the Erdős-Ko-Rado theorem for GP (first proved by Sziklai). 相似文献
12.
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). 相似文献
13.
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. 相似文献
14.
15.
16.
17.
18.
19.
20.