Transformations on irreducible binary polynomials

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Using the natural action of GL2(double-struck F2) ≃ script G3 over double-struck F2[X], one can define different classes of polynomials strongly analogous to self-reciprocal irreducible polynomials. We give transformations to construct polynomials of each kind of invariance and we deal with the question of explicit infinite sequences of invariant irreducible polynomials in double-struck F 2[X]. We generalize results obtained by Varshamov, Wiedemann, Meyn and Cohen and we give sequences of invariant irreducible polynomials. Moreover we explain what happens when the given constructions fail. We also give a result on the order of the polynomials of one of the classes: the alternate irreducible polynomials. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Michon, J. F., & Ravache, P. (2010). Transformations on irreducible binary polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6338 LNCS, pp. 166–180). https://doi.org/10.1007/978-3-642-15874-2_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free