Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A note on the minimal polynomial of the product of linear recurring sequences
Date
1999-08-06
Author
Cakcak, E
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
309
views
0
downloads
Cite This
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 determine some of the elements of J(a, b), in the case of characteristic 2. We also give some clues for the extension to arbitrary characteristic. The method given here has produced a family of matrices which are themselves interesting.
Subject Keywords
Finite field
,
Linear complexity
,
Algebraic closure
,
Minimal polynomial
,
Block diagonal matrix
URI
https://hdl.handle.net/11511/63786
Collections
Department of Mathematics, Conference / Seminar
Suggestions
OpenMETU
Core
Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products
Cenk, Murat; Hasan, M. Anwar (2013-07-01)
In this paper, we consider three-way split formulas for binary polynomial multiplication and Toeplitz matrix vector product (TMVP). We first recall the best known three-way split formulas for polynomial multiplication: the formulas with six recursive multiplications given by Sunar in a 2006 IEEE Transactions on Computers paper and the formula with five recursive multiplications proposed by Bernstein at CRYPTO 2009. Second, we propose a new set of three-way split formulas for polynomial multiplication that a...
A note on divisor class groups of degree zero of algebraic function fields over finite fields
Özbudak, Ferruh (Elsevier BV, 2003-01-01)
We give tight upper bounds on the number of degree one places of an algebraic function field over a finite field in terms of the exponent of a natural subgroup of the divisor class group of degree zero.. (C) 2002 Elsevier Science (USA). All rights reserved.
Additive polynomials and primitive roots over finite fields
Özbudak, Ferruh (2001-01-01)
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.
A note on the transfinite diameter of Bernstein sets
Yazıcı, Özcan (2022-01-01)
A compact set K subset of C-n is called Bernstein set if, for some constant M > 0, the following inequality
A note on the products ((m+1)(2)+1)((m+2)(2)+1) ... (n(2)+1) and ((m+1)(3)+1)((m+2)(3)+1) ... (n(3)+1)
Gurel, Erhan (2016-05-01)
We prove that for any positive integer m there exists a positive real number N-m such that whenever the integer n >= m neither the product P-m(n) = ((m + 1)(2) + 1) ((m + 2)(2) + 1) ... (n(2) + 1) nor the product Q(m)(n) = ((m + 1)(3) + 1)((m + 2)(3) + 1) ... (n(3) + 1) is a square.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Cakcak, “A note on the minimal polynomial of the product of linear recurring sequences,” 1999, p. 57, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/63786.