• DocumentCode
    3531518
  • Title

    A Note on a Class of Permutation Polynomials

  • Author

    Yanbin Zheng

  • Author_Institution
    Key Lab. of Math. & Interdiscipl. Sci., Guangzhou Univ., Guangzhou, China
  • fYear
    2013
  • fDate
    9-11 Sept. 2013
  • Firstpage
    302
  • Lastpage
    306
  • Abstract
    Permutation polynomials have important applications in cryptography, coding theory, combinatorial designs, and other areas of mathematics and engineering. Finding new classes of permutation polynomials is therefore an interesting subject of study. In this paper, two new classes of permutation polynomials over finite fields are presented. Based on the link between equivalent equations and permutation polynomials, some other new permutation polynomials are also obtained. This note is a further study on the recent work of Zha and Hu, Li, Helleseth and Tang.
  • Keywords
    combinatorial mathematics; cryptography; encoding; equivalence classes; polynomials; coding theory; combinatorial designs; cryptography; equivalent equations; finite fields; permutation polynomials; piece-wise functions; Cryptography; Educational institutions; Galois fields; Information theory; Polynomials; Cryptography; Equivalent equations; Finite field; Permutation polynomials; Piecewise functions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Emerging Intelligent Data and Web Technologies (EIDWT), 2013 Fourth International Conference on
  • Conference_Location
    Xi´an
  • Print_ISBN
    978-1-4799-2140-9
  • Type

    conf

  • DOI
    10.1109/EIDWT.2013.58
  • Filename
    6631636