Block companion Singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields
نویسندگان
چکیده
Article history: Received 22 June 2010 Revised 21 November 2010 Accepted 12 February 2011 Available online xxxx Communicated by Zhe-Xian Wan MSC: 11T35 11T06 20G40 15B05
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملPrimitive polynomials, singer cycles and word-oriented linear feedback shift registers
Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plausible approach to prove it in the general case. This conjecture is about the number of primitive σ-LFSRs of a given order over a finite field, and it generalizes a known formula for the number of primitive LFSRs, which...
متن کاملDucci-sequences and cyclotomic polynomials
We study Ducci-sequences using basic properties of cyclotomic polynomials over F2. We determine the period of a given Ducci-sequence in terms of the order of a polynomial, and in terms of the multiplicative orders of certain elements in finite fields. We also compute some examples and study links between Duccisequences, primitive polynomials and Artin’s conjecture on primitive roots. © 2005 Els...
متن کاملTangential Hilbert Problem for Perturbations of Hyperelliptic Hamiltonian Systems
The tangential Hilbert 16th problem is to place an upper bound for the number of isolated ovals of algebraic level curves {H(x, y) = const} over which the integral of a polynomial 1-form P (x, y) dx + Q(x, y) dy (the Abelian integral) may vanish, the answer to be given in terms of the degrees n = degH and d = max(degP, degQ). We describe an algorithm producing this upper bound in the form of a ...
متن کاملOn the Construction of m-Sequences via Primitive Polynomials with a Fast Identification Method
The paper provides an in-depth tutorial of mathematical construction of maximal length sequences (m-sequences) via primitive polynomials and how to map the same when implemented in shift registers. It is equally important to check whether a polynomial is primitive or not so as to get proper m-sequences. A fast method to identify primitive polynomials over binary fields is proposed where the com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 17 شماره
صفحات -
تاریخ انتشار 2011