首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
In this paper, we give the dimension and the minimum distance of two subclasses of narrow-sense primitive BCH codes over Fq with designed distance δ=aqm11(resp. δ=aqm1q1) for all 1aq1, where q is a prime power and m>1 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 [aqm1q1,aqm1q1+T] for 0aq2, where T=qm+121 if m is odd, and T=2qm21 if m is even.  相似文献   

3.
4.
5.
6.
7.
8.
9.
Let M be a random m×n rank-r matrix over the binary field F2, and let wt(M) be its Hamming weight, that is, the number of nonzero entries of M.We prove that, as m,n+ with r fixed and m/n tending to a constant, we have thatwt(M)12r2mn2r(12r)4(m+n)mn converges in distribution to a standard normal random variable.  相似文献   

10.
In this paper, we establish a new asymptotic expansion of Gurland's ratio of gamma functions, that is, as x,Γ(x+p)Γ(x+q)Γ(x+(p+q)/2)2=exp?[k=1nB2k(s)?B2k(1/2)k(2k?1)(x+r0)2k?1+Rn(x;p,q)]where p,qR with w=|p?q|0 and s=(1?w)/2, r0=(p+q?1)/2, B2n+1(s) are the Bernoulli polynomials. Using a double inequality for hyperbolic functions, we prove that the function x?(?1)nRn(x;p,q) is completely monotonic on (?r0,) if |p?q|<1, which yields a sharp upper bound for |Rn(x;p,q)|. This shows that the approximation for Gurland's ratio by the truncation of the above asymptotic expansion has a very high accuracy. We also present sharp lower and upper bounds for Gurland's ratio in terms of the partial sum of hypergeometric series. Moreover, some known results are contained in our results when qp.  相似文献   

11.
12.
We consider four classes of polynomials over the fields Fq3, q=ph, p>3, f1(x)=xq2+q1+Axq2q+1+Bx, f2(x)=xq2+q1+Axq3q2+q+Bx, f3(x)=xq2+q1+Axq2Bx, f4(x)=xq2+q1+AxqBx, where A,BFq. We find sufficient conditions on the pairs (A,B) for which these polynomials permute Fq3 and we give lower bounds on the number of such pairs.  相似文献   

13.
14.
《Discrete Mathematics》2023,346(4):113304
In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size s+1? In this note, we improve upon a recent result of Frankl and resolve this problem for s>101k3 and (s+1)k?n<(s+1)(k+1100k).  相似文献   

15.
16.
17.
18.
Let χ be an order c multiplicative character of a finite field and f(x)=xd+λxe a binomial with (d,e)=1. We study the twisted classical and T-adic Newton polygons of f. When p>(de)(2d1), we give a lower bound of Newton polygons and show that they coincide if p does not divide a certain integral constant depending on pmodcd.We conjecture that this condition holds if p is large enough with respect to c,d by combining all known results and the conjecture given by Zhang-Niu. As an example, we show that it holds for e=d1.  相似文献   

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

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