Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 15 of 25.

Add to Quick Collection   All 25 Results

Sort:
 Add All Items to Quick Collection
Date: 2004
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/118615
Description: 19 page(s)
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/129931
Description: 10 page(s)
Reviewed: Reviewed
Date: 2011
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/159886
Description: 9 page(s)
Reviewed: Reviewed
Date: 2004
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/80512
Description: In 1989, F. R. K. Chung gave a construction for certain directed h-regular graphs of small diameter.Her construction is based on finite fields, and the upper bound on the diameter of these graphs is d ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/81785
Description: We use character sums to confirm several recent conjectures of V. I. Arnold on the uniformity of distribution properties of a certain dynamical system in a finite field. On the other hand, we show tha ... More
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/130997
Description: We give upper bounds for sums of multiplicative characters modulo an integer q ≧ 2 with the Euler function ϕ ( n ) and with the shifted largest prime divisor P ( n ) + a of integers n ≦ x .
Reviewed: Reviewed
Date: 2012
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/181747
Description: 13 page(s)
Full Text: Full Text
Reviewed: Reviewed
Date: 2016
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1195192
Description: We derive two new upper bounds on the double multiplicative character sum over subgroups and intervals Rχ(a,g,I,N)=∑x=1H|∑n=1Nχ(x+agⁿ)| where χ is a multiplicative character modulo a prime p, H and N ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/13401
Description: We obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequences over arbitrary finite rings.
Reviewed: Reviewed
Date: 2011
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/144773
Description: Given a prime p, the Fermat quotient qp(u) of u with gcd (u,p)=1 is defined by the conditions qp(u) ≡ up-1-1/p mod p, -< qp (u) ≤ p -1. We derive a new bound on multiplicative character sums with Ferm ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/20158
Description: We estimate certain double character sums over points of an elliptic curve and in the multiplicative subgroup of a finite field. These bounds both improve and extend the scope of a series of previous ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/128904
Description: 9 page(s)
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/41852
Description: We estimate character sums over points on elliptic curves over a finite field Fq of q elements. Pseudorandom sequences can be constructed by taking linear combinations with small coefficients (for exa ... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1197784
Description: We introduce and use some new arguments to improve upper bounds of Chung and of Lu, Wan, Wang, and Zhang on the diameter of some Cayley graphs constructed from polynomials over a finite field.
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/20124
Description: For a Sidelnikov sequence of period pm-1, tight lower bounds are obtained on its linear complexity L over Fp. In particular, these bounds imply that, uniformly over all p and m, L is close to its larg ... More
Full Text: Full Text
Reviewed: Reviewed