Problems on Permutation and Irreducible Polynomials Over Finite Fields

Public Deposited
Resource Type
Creator
Contributors
Abstract
  • This integrated thesis is dedicated to the study of polynomials over finite fields, notably permutation polynomials and their compositional inverses, existence of irreducible polynomials with prescribed coefficients, as well as ennumeration of N-free and primitive elements with prescribed trace.

Subject
Language
Publisher
Thesis Degree Level
Thesis Degree Name
Thesis Degree Discipline
Identifier
Rights Notes
  • Copyright © 2018 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, research, scholarship, and teaching. Theses may only be shared by linking to Carleton University Institutional Repository and no part may be used without proper attribution to the author. No part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner.

Date Created
  • 2018

Relations

In Collection: