Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/359243
Title: Permutation Polynomials And Their Combinatorial Applications
Researcher: Kumar Singh, Mritunjay
Guide(s): Prapap Singh, Rajesh
Keywords: Computer Science
Computer Science Theory and Methods
Engineering and Technology
University: Central University of South Bihar
Completed Date: 2021
Abstract: newline From the 19th century, the theory of permutation polynomial over finite fields, newlinethat are arose in the work of Hermite and Dickson, has drawn general at- newlinetention. The last three decades has seen rapid progress on the research on newlinepermutation polynomials due to their diverse applications in cryptography, newlinecoding theory, finite geometry, combinatorics and many more areas of math- newlineematics and engineering. For this reason, the study of permutation poly- newlinenomials is important. This thesis is mainly devoted to the study of some newlineproblems on permutation polynomials and their combinatorial applications. newlineThe arrangement of this thesis is as follows. newlineIn first chapter, we introduce basic definitions and some useful lemmas newlinethat are helpful to understand entire thesis. newlineAlthough various type of different classes of permutation polynomials newlinewith simple appearance or good properties have been found day by day, newlinebut the general problems of characterization of permutation polynomials of newlineprescribed forms are still challenging. We present some new classes of per- newlinemutation pentanomials by using some known results in the second chapter. newlineThird chapter is associated with an equivalent form of Kloosterman poly- newlinenomials conjecture that are posed by Hollmann and Xiang in 2004 in a deeper newlineconnection to permutation polynomials. The study of Kloosterman polyno- newlinemials are interesting because every Kloosterman polynomial give rise to a newlinenew Kloosterman sum identity. newlinePlanar functions are of central interest in cryptography, coding theory newlineand design theory. It is not hyperbole to say that being planar is a very newlinerestrictive property. It is not easy to find planar functions. There is even newlineno classification known of all monomials planar functions. Thus, finding new classes of planar functions are in particular interesting. In this way, we have newlinecontributed a new class of planar functions over finite fields in fourth chapter. newlineIn finite field theory, to apply permutation polynomials in other area of newlinemathematics and engineering is also
Pagination: 
URI: http://hdl.handle.net/10603/359243
Appears in Departments:Mathematics

Files in This Item:
File Description SizeFormat 
80_recommendation.pdfAttached File38.81 kBAdobe PDFView/Open
bibliography.pdf152.75 kBAdobe PDFView/Open
certificate.pdf58.08 kBAdobe PDFView/Open
chapter-1.pdf219.86 kBAdobe PDFView/Open
chapter-2.pdf182.56 kBAdobe PDFView/Open
chapter-3.pdf212.07 kBAdobe PDFView/Open
chapter-4.pdf178.79 kBAdobe PDFView/Open
chapter-5.pdf188.61 kBAdobe PDFView/Open
chapter-6.pdf192.08 kBAdobe PDFView/Open
chapter-7.pdf38.81 kBAdobe PDFView/Open
list-of-papers.pdf3.25 MBAdobe PDFView/Open
priliminary-pages.pdf147.16 kBAdobe PDFView/Open
title.pdf4.04 MBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: