共查询到20条相似文献,搜索用时 15 毫秒
1.
Anuradha Sharma Gurmeet K. Bakshi V. C. Dumir Madhu Raka 《Finite Fields and Their Applications》2004,10(4):133
Let q be an odd prime power and p be an odd prime with gcd(p,q)=1. Let order of q modulo p be f,
and qf=1+pλ. Here expressions for all the primitive idempotents in the ring Rpn=GF(q)[x]/(xpn−1), for any positive integer n, are obtained in terms of cyclotomic numbers, provided p does not divide λ if n2. The dimension, generating polynomials and minimum distances of minimal cyclic codes of length pn over GF(q) are also discussed. 相似文献
2.
Primitive polynomial with three coefficients prescribed 总被引:1,自引:1,他引:0
The authors proved in Fan and Han (Finite Field Appl., in press) that, for any given (a1,a2,a3)Fq3, there exists a primitive polynomial f(x)=xn−σ1xn−1++(−1)nσn over Fq of degree n with the first three coefficients σ1,σ2,σ3 prescribed as a1,a2,a3 when n8. But the methods in Fan and Han (in press) are not effective for the case of n=7. Mills (Existence of primitive polynomials with three coefficients prescribed, J. Algebra Number Theory Appl., in press) resolves the n=7 case for finite fields of characteristic at least 5. In this paper, we deal with the remaining cases and prove that there exists a primitive polynomial of degree 7 over Fq with the first three coefficient prescribed where the characteristic of Fq is 2 or 3. 相似文献
3.
Stanis
aw Lewanowicz 《Journal of Computational and Applied Mathematics》2003,150(2):193-327
Let {pk(x; q)} be any system of the q-classical orthogonal polynomials, and let be the corresponding weight function, satisfying the q-difference equation Dq(σ)=τ, where σ and τ are polynomials of degree at most 2 and exactly 1, respectively. Further, let {pk(1)(x;q)} be associated polynomials of the polynomials {pk(x; q)}. Explicit forms of the coefficients bn,k and cn,k in the expansions are given in terms of basic hypergeometric functions. Here k(x) equals xk if σ+(0)=0, or (x;q)k if σ+(1)=0, where σ+(x)σ(x)+(q−1)xτ(x). The most important representatives of those two classes are the families of little q-Jacobi and big q-Jacobi polynomials, respectively.Writing the second-order nonhomogeneous q-difference equation satisfied by pn−1(1)(x;q) in a special form, recurrence relations (in k) for bn,k and cn,k are obtained in terms of σ and τ. 相似文献
4.
Jianqin Zhou 《Designs, Codes and Cryptography》2011,58(3):279-296
In this paper, we first optimize the structure of the Wei–Xiao–Chen algorithm for the linear complexity of sequences over GF(q) with period N = 2p
n
, where p and q are odd primes, and q is a primitive root modulo p
2. The second, an union cost is proposed, so that an efficient algorithm for computing the k-error linear complexity of a sequence with period 2p
n
over GF(q) is derived, where p and q are odd primes, and q is a primitive root modulo p
2. The third, we give a validity of the proposed algorithm, and also prove that there exists an error sequence e
N
, where the Hamming weight of e
N
is not greater than k, such that the linear complexity of (s + e)
N
reaches the k-error linear complexity c. We also present a numerical example to illustrate the algorithm. Finally, we present the minimum value k for which the k-error linear complexity is strictly less than the linear complexity. 相似文献
5.
Wilderotter Klaus 《Journal of Complexity》1995,11(4)
The n-widths of the unit ball Ap of the Hardy space Hp in Lq( −1, 1) are determined asymptotically. It is shown that for 1 ≤ q < p ≤∞ there exist constants k1 and k2 such that [formula]≤ dn(Ap, Lq(−1, 1)),dn(Ap, Lq(−1, 1)), δn(Ap, Lq(−1, 1))[formula]where dn, dn, and δn denote the Kolmogorov, Gel′fand and linear n-widths, respectively. This result is an improvement of estimates previously obtained by Burchard and Höllig and by the author. 相似文献
6.
Let Bn( f,q;x), n=1,2,… be q-Bernstein polynomials of a function f : [0,1]→C. The polynomials Bn( f,1;x) are classical Bernstein polynomials. For q≠1 the properties of q-Bernstein polynomials differ essentially from those in the classical case. This paper deals with approximating properties of q-Bernstein polynomials in the case q>1 with respect to both n and q. Some estimates on the rate of convergence are given. In particular, it is proved that for a function f analytic in {z: |z|<q+} the rate of convergence of {Bn( f,q;x)} to f(x) in the norm of C[0,1] has the order q−n (versus 1/n for the classical Bernstein polynomials). Also iterates of q-Bernstein polynomials {Bnjn( f,q;x)}, where both n→∞ and jn→∞, are studied. It is shown that for q(0,1) the asymptotic behavior of such iterates is quite different from the classical case. In particular, the limit does not depend on the rate of jn→∞. 相似文献
7.
Generalized Hadamard matrices of order qn−1 (q—a prime power, n2) over GF(q) are related to symmetric nets in affine 2-(qn,qn−1,(qn−1−1)/(q−1)) designs invariant under an elementary abelian group of order q acting semi-regularly on points and blocks. The rank of any such matrix over GF(q) is greater than or equal to n−1. It is proved that a matrix of minimum q-rank is unique up to a monomial equivalence, and the related symmetric net is a classical net in the n-dimensional affine geometry AG(n,q). 相似文献
8.
For a real x -1 we denote by Sk[X] the set of k-full integers n x, that is, the set of positive integers n x such that ℓk|n for any prime divisor ℓ|n. We estimate exponential sums of the form where is a fixed integer with gcd (, p) = 1, and apply them to studying the distribution of the powers n, n Sk[x], in the residue ring modulo p 1. 相似文献
9.
We give a direct formulation of the invariant polynomials μGq(n)(, Δi,;, xi,i + 1,) characterizing U(n) tensor operators p, q, …, q, 0, …, 0 in terms of the symmetric functions Sλ known as Schur functions. To this end, we show after the change of variables Δi = γi − δi and xi, i + 1 = δi − δi + 1 thatμGq(n)(,Δi;, xi, i + 1,) becomes an integral linear combination of products of Schur functions Sα(, γi,) · Sβ(, δi,) in the variables {γ1,…, γn} and {δ1,…, δn}, respectively. That is, we give a direct proof that μGq(n)(,Δi,;, xi, i + 1,) is a bisymmetric polynomial with integer coefficients in the variables {γ1,…, γn} and {δ1,…, δn}. By making further use of basic properties of Schur functions such as the Littlewood-Richardson rule, we prove several remarkable new symmetries for the yet more general bisymmetric polynomials μmGq(n)(γ1,…, γn; δ1,…, δm). These new symmetries enable us to give an explicit formula for both μmG1(n)(γ; δ) and 1G2(n)(γ; δ). In addition, we describe both algebraic and numerical integration methods for deriving general polynomial formulas for μmGq(n)(γ; δ). 相似文献
10.
Primitive normal polynomials with a prescribed coefficient 总被引:1,自引:0,他引:1
In this paper, we established the existence of a primitive normal polynomial over any finite field with any specified coefficient arbitrarily prescribed. Let n15 be a positive integer and q a prime power. We prove that for any aFq and any 1m<n, there exists a primitive normal polynomial f(x)=xn−σ1xn−1++(−1)n−1σn−1x+(−1)nσn such that σm=a, with the only exceptions σ1≠0. The theory can be extended to polynomials of smaller degree too. 相似文献
11.
Amin Coja-Oghlan Konstantinos Panagiotou Angelika Steger 《Journal of Combinatorial Theory, Series B》2008,98(5):980-993
In this paper we consider the classical Erdős–Rényi model of random graphs Gn,p. We show that for p=p(n)n−3/4−δ, for any fixed δ>0, the chromatic number χ(Gn,p) is a.a.s. ℓ, ℓ+1, or ℓ+2, where ℓ is the maximum integer satisfying 2(ℓ−1)log(ℓ−1)p(n−1). 相似文献
12.
Exact comparisons are made relating E|Y0|p, E|Yn−1|p, and E(maxj≤n−1 |Yj|p), valid for all martingales Y0,…,Yn−1, for each p ≥ 1. Specifically, for p > 1, the set of ordered triples {(x, y, z) : X = E|Y0|p, Y = E |Yn−1|p, and Z = E(maxj≤n−1 |Yj|p) for some martingale Y0,…,Yn−1} is precisely the set {(x, y, z) : 0≤x≤y≤z≤Ψn,p(x, y)}, where Ψn,p(x, y) = xψn,p(y/x) if x > 0, and = an−1,py if x = 0; here ψn,p is a specific recursively defined function. The result yields families of sharp inequalities, such as E(maxj≤n−1 |Yj|p) + ψn,p*(a) E |Y0|p ≤ aE |Yn−1|p, valid for all martingales Y0,…,Yn−1, where ψn,p* is the concave conjugate function of ψn,p. Both the finite sequence and infinite sequence cases are developed. Proofs utilize moment theory, induction, conjugate function theory, and functional equation analysis. 相似文献
13.
This paper presents procedures for constructing irreducible polynomials over GF(2s) with linearly independent roots (or normal polynomials or N-polynomials). For a suitably chosen initial N-polynomial F0(x)GF(2s) of degree n, polynomials Fk(x)GF(2s) of degrees n2k are constructed by iteratively applying the transformation x→x+x-1, and their roots are shown to form a normal basis of GF(2sn2k) over GF(2s). In addition, the sequences are shown to be trace compatible, i.e., the trace map TGF(2sn2k+1)/GF(2sn2k) fromGF(2sn2k+1) onto GF(2sn2k) maps the roots of Fk+1(x) onto those of Fk(x). 相似文献
14.
Rong-Qing Jia 《Journal of Approximation Theory》1983,37(4):293-310
For an integer k 1 and a geometric mesh (qi)−∞∞ with q ε (0, ∞), let Mi,k(x): = k[qi + k](· − x)+k − 1, Ni,k(x): = (qi + k − qiMi,k(x)/k, and let Ak(q) be the Gram matrix (∝Mi,kNj,k)i,jεz. It is known that Ak(q)−1∞ is bounded independently of q. In this paper it is shown that Ak(q)−1∞ is strictly decreasing for q in [1, ∞). In particular, the sharp upper bound and lower bound for Ak (q)−1 are obtained: for all q ε (0, ∞). 相似文献
15.
Let GF(q) be a finite field of q elements. Let G denote the group of matrices M(x, y) = (y x0 1) over GF(q) with y ≠ 0. Fix an irreducible polynomial For each a ϵ GF(q), let Xa be the graph whose vertices are the q2 − q elements of G, with two vertices M(x, y), M(v, w) joined by an edge if and only if The graphs Xa with a ϵ/ {0, t2 − 4n} are (q + 1)-regular connected graphs which have received recent attention, as they've been shown to be Ramanujan graphs. We determine the diameter of these graphs Xa. © 1996 John Wiley & Sons, Inc. 相似文献
16.
Let X1, X2, …, Xn be random vectors that take values in a compact set in Rd, d ≥ 1. Let Y1, Y2, …, Yn be random variables (“the responses”) which conditionally on X1 = x1, …, Xn = xn are independent with densities f(y | xi, θ(xi)), i = 1, …, n. Assuming that θ lives in a sup-norm compact space Θq,d of real valued functions, an optimal L1-consistent estimator
of θ is constructed via empirical measures. The rate of convergence of the estimator to the true parameter θ depends on Kolmogorov's entropy of Θq,d. 相似文献
17.
In this paper, the authors study the asymptotic behavior of solutions of second-order neutral type difference equations of the form
Δ2(yn+pyn−k)+f(n,yn−ℓ)=0,n