Additive polynomials and primitive roots over finite fields

Date

2001-01-01

Author

Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

213
views

0
downloads

We prove existence of primitive roots with a prescribed nonzero image using the arithmetic of algebraic function fields for a class of polynomials over sufficiently large finite fields.

Subject Keywords

Finite fields, Primitive roots, Additive polynomials

URI

https://hdl.handle.net/11511/39536

Journal

COMMUNICATIONS IN ALGEBRA

DOI

https://doi.org/10.1081/agb-100001661

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

On multiplication in finite fields Cenk, Murat; Özbudak, Ferruh (2010-04-01) We present a method for multiplication in finite fields which gives multiplication algorithms with improved or best known bilinear complexities for certain finite fields. Our method generalizes some earlier methods and combines them with the recently introduced complexity notion (M) over cap (q)(l), which denotes the minimum number of multiplications needed in F-q in order to obtain the coefficients of the product of two arbitrary l-term polynomials modulo x(l) in F-q[x]. We study our method for the finite ...
Additive polynomials over perfect fields Durhan, Salih (2011-07-29) Additive polynomials in one variable over valued fields of positive characteristic are sufficiently well understood in terms of their approximation properties. We extend results in this direction to multi-variable additive polynomials over perfect valued fields.
A note on the minimal polynomial of the product of linear recurring sequences Cakcak, E (1999-08-06) Let F be a field of nonzero characteristic, with its algebraic closure, F. For positive integers a, b, let J(a, b) be the set of integers k, such that (x - 1)k is the minimal polynomial of the termwise product of linear recurring sequences sigma and tau in F ($) over bar, with minimal polynomials (x - 1)(a) and (x - 1)(b) respectively. This set plays a crucial role in the determination of the product of linear recurring sequences with arbitrary minimal polynomials. Here, we give an explicit formula to deter...
Cyclic codes and reducible additive equations Guneri, Cem; Özbudak, Ferruh (Institute of Electrical and Electronics Engineers (IEEE), 2007-02-01) We prove a Weil-Serre type bound on the number of solutions of a class of reducible additive equations over finite fields. Using the trace representation of cyclic codes, this enables us to write a general estimate for the weights of cyclic codes. We extend Woffmann's weight bound to a larger classes of cyclic codes. In particular, our result is applicable to any cyclic code over F-p and F-p2, where p is an arbitrary prime. Examples indicate that our bound performs very well against the Bose-Chaudhuri-Hocqu...
Value sets of Lattes maps over finite fields Küçüksakallı, Ömer (Elsevier BV, 2014-10-01) We give an alternative computation of the value sets of Dickson polynomials over finite fields by using a singular cubic curve. Our method is not only simpler but also it can be generalized to the non-singular elliptic case. We determine the value sets of Lattes maps over finite fields which are rational functions induced by isogenies of elliptic curves with complex multiplication.

Citation Formats

F. Özbudak, “Additive polynomials and primitive roots over finite fields,” COMMUNICATIONS IN ALGEBRA, pp. 987–991, 2001, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/39536.