A Note on the Minimal Polynomial of the Product of Linear Recurring Sequences

Emrah Çakçak ()
Additional contact information
Emrah Çakçak: Middle East Technical University, Department of Mathematics

A chapter in Finite Fields and Applications, 2001, pp 57-69 from Springer

Abstract: Abstract Let F be a field of nonzero characteristic, with its algebraic closure, $$ \bar{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 σ and τ in $$ \bar{F} $$ , 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.

Keywords: Finite Field; Linear Complexity; Algebraic Closure; Minimal Polynomial; Block Diagonal Matrix (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-56755-1_6

Ordering information: This item can be ordered from
http://www.springer.com/9783642567551

DOI: 10.1007/978-3-642-56755-1_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().