DOCSLIB.ORG

Quadratic Permutation Polynomial Interleavers for LTE Turbo Coding

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quadratic Permutation Polynomial Interleavers for LTE Turbo Coding International Journal of Future Computer and Communication, Vol. 2, No. 4, August 2013 Quadratic Permutation Polynomial Interleavers for LTE Turbo Coding Ching-Lung Chi Abstract—Interleaver is an important component of turbo min δ, (2) , code and has a strong impact on its error correcting performance. Quadratic permutation polynomial (QPP) δ, is the Lee metric between points interleaver is a contention-free interleaver which is suitable for , π and p j,πj parallel turbo decoder implementation. To improve the performance of LTE QPP interleaver, largest-spread and , || | | (3) maximum-spread QPP interleavers are analyzed for Long Term Evolution (LTE) turbo codes in this paper. Compared where with LTE QPP interleaver, those algorithms have low computing complexity and better performances from || mod , mod (4) simulation results. The quadratic polynomials which lead to the largest spreading factor for some interleaver lengths are given in Index Terms—Quadratic permutation polynomial (QPP) interleaver, Long Term Evolution (LTE), largest-spread QPP [2]. An algorithm for faster computation of is also interleaver, maximum-spread QPP interleaver. presented. It is based on the representatives of orbits in the representation of interleavercode. Section II gives a brief review of QPP interleaver. Largest-Spread and Maximum-Spread QPP interleavers are I. INTRODUCTION the topics of Section III. Section IV presents the bit error The selection of turbo coding was considered during the rates (BER) resulted from simulations for LTE standard, LS study phase of Long Term Evolution (LTE) standard to and MS QPP inter leavers length 512. Section V concludes meet the stringent requirements. Following deliberations the paper. within the working group, the quadratic permutation polynomials (QPP) were selected as interleavers for turbo codes, emerging as the most promising solutions to the LTE II. QPP INTERLEAVERS requirements. The QPP interleavers for the LTE standard [1] involve 188 different lengths. In this paper we take two A. Permutation Polynomial(PP) over Integer kinds of methods to improve the LTE QPP interleaver. Given an integer2, a polynomial The polynomial interleavers offer the following benefits , where , , , , and are [2]: special performance, complete algebraic structure, and nonnegative integers, is said to be a permutation polynomial efficient implementation (high speed and low memory over when permutes 0, 1, 2, , 1. requirements). A QPP interleaver of length L is defined In this paper, all the summations and multiplications are as: modulo unless explicitly stated. We further define the π x mod ,01 (1) formal derivative of the polynomial to be a where and are chosen so that the quadratic polynomial such that 23 polynomialin (1) is a permutation polynomial (i.e. the . For any integer , whether polynomial set π0,π1,,π1 is a permutation of the is a permutation polynomial can be determined by set 0,1, , 1 and determines a shift of the the following theorem [3]. permutation elements. Theorem 1: Let 23 In the following we only consider quadratic polynomials be a polynomial with integer coefficients. is a permutation polynomial over the integer ring 2 if with free term 0 , as for the QPP interleavers in the and only if 1) is odd, 2) is even, and LTEstandard. If 0,1, , 1 , then the 3) is even. permutation function is: . The spread factor D is defined as Theorem 2: is a permutation polynomial over the integer ring2 if and only ifis a permutation polynomial over Z and 0modulo for all integersx. Manuscript received October 25, 2012; revised November 25, 2012. Theorem 3: For any ∏ , where are Ching-Lung Chi is with the Dept. of Computer and Communication SHU-TE University Kaohsiung City 824, Taiwan (e-mail: distinctprime numbers, is a permutation polynomial [email protected]) modulo if and only if is also a permutation DOI: 10.7763/IJFCC.2013.V2.186 364 International Journal of Future Computer and Communication, Vol. 2, No. 4, August 2013 polynomial modulo , . TABLE I: EXAMPLES OF MAXIMUM-SPREAD QPP INTERLEAVER ζ ζ 4 128 15 32 17 32 16 2 2 64 5 512 31 64 33 64 35 4 3 128 6 2048 63 128 65 128 64 8 4 256 7 8192 127 256 129 256 128 12 7 512 8 32768 255 512 257 512 256 32 12 1024 9 131072 511 1024 513 1024 512 64 23 2048 Because the function of interleaver is to permute search metric on choosing better coefficients, before this we 0,1, , 1 , we can apply the construction of present some definitions firstly: permutation polynomial over integer to Turbo 1) Distance interleavers by properly choosing and polynomial coefficients . The first-degree polynomial , | | | | (5) (linear interleaver) is the simplest one among all where|| minmod , mod . permutation polynomials. However, the linear interleaver has very bad input weight 4 error event characteristics, 2) Spread Factor causing a higher error floor for medium or long frame size min , , (6) cases. And quadratic permutation polynomial can overcome where, and . these defects, this leaves it the next in the chain. When 2, becomes . Notice 3) Nonlinearity Metric of QPP Interleavers that the coefficient just corresponds to a cyclic rotation ⁄ gcd2, (7) in the interleaved sequence. It does not appear in the conditions for to be a permutation polynomial and it Obviously, QPP interleaver can be viewed as a linear does not affect the performance. We ignore for interleaver that is “disturbed” by quadratic simplification, so becomes quadratic polynomial interleaver , the periodicity of the disturbance is at most.This disturbance can overcome a higher error floor of .. linear interleaver at a certain extent. B. QPP Interleavers Since the minimum distance of a turbo code is now QPP Interleaver completes interleaving by making QP known to grow at most logarithmically, therefore, the spread (Quadratic Polynomial) satisfy some conditions. In order factor that controls the effective free distance should be to makebe a QPP, coefficients and have to meet “rewarded” at most logarithmically. The nonlinearity is some special conditions. Then the following 2 corollaries expected to have a proportional reduction in the deduced from theorem 1 and 2 are given. multiplicities of low-weight code words so it is reasonable Corollary 1 [3]: A quadratic polynomial of the to leave it. So we can get a simple metric of searching form is a permutation polynomial coefficients of QPP interleaver [4]. over if and only if 0and 0 mod. , Corollary 2 [4]: Let∏ , denote divides maxΩ ln (8) by | and denote can not divides by . The Further choosing coefficients and by necessary and sufficient condition for a quadratic maximizationΩ, we can get some coefficients with good polynomial to be a permutation performances. Sincewill grow fast as grows, it is not polynomial can be divided into two cases. good for improving decoding performance, so it must be 1) 2|and4 (i.e., , 1) modified. We define a new modified nonlinearity metric , is odd, gcd,⁄ 2 1, and ∏ , which can avoid above defect. So we have a corresponding refined metric , 1, psuch that2and, 1. maxΩ ln (9) 2) Either 2 or 4| (i.e., , 1 ) gcd , 1and ∏ , , 1, psuch , where mod |0,1,,1 that, 1. Through this refined metric, we search coefficients more Apply above corollaries, we can find some available than one couple, since the up-bound of interleavers spread coefficients and in QPP interleavers by computer factor is √2 , in order to avoid not searching. However, the interleavers with different becoming so small when frame sizeis small that we limit coefficients have different performances, so we have to the search process under the condition of √2 , choose better based on these coefficients. Then we discuss 365 International Journal of Future Computer and Communication, Vol. 2, No. 4, August 2013 where 0.45. While 2000, must decrease to 0.30 Relationships (19) and (20) could also be obtained as properly. follows. From (12) we have ⁄ 2 (21) III. LARGEST-SPREAD AND MAXIMUM-SPREAD QPP ⁄ (22) INTERLEAVERS 2 A. Largest-Spread QPP Interleaver Then, from (14) we get In this section we present a theorem which states · (23) sufficient conditions to be satisfied by the coefficients of Or, taking into account (21), (22) and (13), two quadratic polynomials [4], so that the resulting ⁄ interleavers are identical. For the LTE standard, the · 2· (24) interleaver’s length is always an even number. Or, from (15), Theorem 4: Consider two QPP interleavers described by ·2⁄· · (25) the following polynomials (the free term is considered zero): From here, (19) and (20) result immediately. mod , x 0,1, , L 1 (10) Because 0,1, , 1, 1 and 1are mod , x0,1,,L1 (11) divisible by 2, i.e. then, there are, which verify relation (13). Ifis even, then , and the following relation is fulfilled: The theorem shows that two QPPs generate identical permutation functions, if the coefficients are at the same ⁄ 2 (12) distance 2⁄. Therefore, we can only consider The two quadratic polynomials lead to identical coefficients 0,1,,2⁄1in polynomial searching, permutations. because the interleaver mod is the Proof: same as theinterleaver ⁄ 2 For the two QPP to lead to identical permutations, it is 2⁄ mod , if ⁄ 2, or as the interleaver described required that by the permutation ⁄ 2 , 0,1,,1 (13) 2⁄ mod , if ⁄ 2. As the number of searched We denote QPPs is halved, so is the search time, therefore speeding up the search process. · (14) B. Maximum-Spread QPP Interleaver · (15) Theorem 5: The following is an infinite sequence of QPPs where , .Under the conditions above we have to that generate maximum-spread interleavers: Show that there are , , 0,1, , 1 , which verify relationship (13). Subtracting (14) from (15) 2 1x2mod2 k 1,2,3, and considering (13), we have: (26) Strictly, we have QPP interleavers only when 3.
Load more

Recommended publications
  • ON SOME PERMUTATION POLYNOMIALS OVER Fq of THE
    ON SOME PERMUTATION POLYNOMIALS OVER Fq r (q 1)=d OF THE FORM x h(x − ) MICHAEL E. ZIEVE Abstract. Several recent papers have given criteria for certain polynomials to permute Fq, in terms of the periods of certain gen- eralized Lucas sequences. We show that these results follow from a more general criterion which does not involve such sequences. 1. Introduction A polynomial over a finite field is called a permutation polynomial if it permutes the elements of the field. These polynomials first arose in work of Betti [5], Mathieu [25] and Hermite [20] as a way to represent permutations. A general theory was developed by Hermite [20] and Dickson [13], with many subsequent developments by Carlitz and oth- ers. The study of permutation polynomials has intensified in the past few decades, due both to various applications (e.g., [8, 11, 14, 30]) and to an increasing appreciation of the depth of the subtleties inherent to permutation polynomials themselves (for instance, work on permuta- tion polynomials led to a bound on the automorphism group of a curve with ordinary Jacobian [19]). The interesting aspect of permutation polynomials is the interplay between two different ways of representing an object: combinatorially, as a mapping permuting a set, and algebraically, as a polynomial. This is exemplified by one of the first results in the subject, namely that there is no permutation polynomial over Fq of degree q 1 if q > 2 [20]. Much recent work has focused on low-degree permutation− polynomials, as these have quite remarkable properties: for instance, a polynomial of 1=4 degree at most q which permutes Fq will automatically permute Fqn for infinitely many n.
    [Show full text]
  • Constructing Permutation Arrays from Semilinear Groups
    Constructing Permutation Arrays from Semilinear Groups Avi Levy 2/17/2013 Contents 1 Introduction 2 2 Overview and Notation 2 2.1 Finite Fields . 2 2.2 Permutation Polynomials . 2 2.3 Classical Groups . 2 2.4 Hamming distance and Permutation Arrays . 3 3 Constructions 3 3.1 AGL(1; Fq) ............................ 3 3.2 AΓL(1; Fq)............................. 3 3.3 P GL(2; Fq) ............................ 4 3.4 P ΓL(1; Fq)............................. 4 4 Hamming Distance Computations 4 4.1 Preliminaries . 4 4.2 AΓL ................................ 5 4.3 P ΓL ................................ 6 5 Root-counting Results 7 6 Conclusions 10 7 Bibliography 10 1 1 Introduction This is a preliminary writeup of my work with the semilinear groups. These groups yield new permutation arrays with large pairwise Hamming distances. Their properties are well-understood, which allows the minimal pairwise Hamming distance to be obtained without resorting to direct computation. 2 Overview and Notation 2.1 Finite Fields n Given q = p , a power of a prime, call the unique field with q elements Fq. 2 q−2 Fq = f0; 1; g; g ; ··· ; g g where g is any generator of Fq. 2.2 Permutation Polynomials Let f : Fq ! Fq be a polynomial function with coefficients in Fq. If f is one-to-one, then f permutes the elements of Fq. In this case, f is called a permutation polynomial, and the permutation corresponding to f is: σf : x ! f(x) 2.3 Classical Groups There are four families of groups that we are concerned with in this paper. • AGL(n; F): affine general linear group of dimension n over the field F.
    [Show full text]
  • New Permutation Trinomials from Niho Exponents Over Finite Fields
    New Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic Nian Li and Tor Helleseth ∗ Abstract In this paper, a class of permutation trinomials of Niho type over finite fields with even char- acteristic is further investigated. New permutation trinomials from Niho exponents are obtained from linear fractional polynomials over finite fields, and it is shown that the presented results are the generalizations of some earlier works. 1 Introduction m Let p be a prime and Fpm denote the finite field with p elements. A polynomial f(x) ∈ Fpm [x] is called a permutation polynomial of Fpm if the associated polynomial function f : c 7→ f(c) from Fpm to Fpm is a permutation of Fpm [15]. Permutation polynomials over finite fields, which were first studied by Hermite [6] and Dickson [2], have wide applications in the areas of mathematics and engineering such as coding theory, cryptography and combinatorial designs. The construction of permutation polynomials with either a simple form or certain desired property is an interesting research problem. For some recent constructions of permutation polynomials with a simple form, the reader is referred to [3, 8, 10, 13, 18, 19, 23] and for some constructions of permutation polynomials with certain desired property, the reader is referred to [1, 4, 5, 12, 20, 21, 22] and the references therein for example. Permutation binomials and trinomials attract researchers’ attention in arXiv:1606.03768v1 [cs.IT] 12 Jun 2016 recent years due to their simple algebraic form, and some nice works on them had been achieved in [3, 10, 18, 23].
    [Show full text]
  • New Permutation Trinomials Constructed from Fractional
    1 New Permutation Trinomials Constructed from Fractional Polynomials Kangquan Li, Longjiang Qu, Chao Li and Shaojing Fu** Abstract Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six new classes of permutation trinomials over finite fields of even characteristic are constructed from six fractional polynomials. Further, three classes of permutation trinomials over finite fields of characteristic three are raised. Distinct from most of the known permutation trinomials which are with fixed exponents, our results are some general classes of permutation trinomials with one parameter in the exponents. Finally, we propose a few conjectures. Index Terms Finite Field, Permutation Trinomial, Fractional Polynomial. 1. INTRODUCTION Let Fq be the finite field with q elements. A polynomial f ∈ Fq[x] is called a permutation polynomial (PP) if the induced mapping x → f(x) is a permutation of Fq. The study about permutation polynomials over finite fields attracts people’s interest for many years due to their wide applications in coding theory [15, 24], cryptography [19, 22, 23] and combinatorial designs [5]. For example, Ding et al.[5] constructed a family of skew Hadamard difference sets via the Dickson permutation polynomial of order five, which disproved the longstanding conjecture on skew Hadamard difference sets. More recent progress on permutation polynomials can be found in [2, 4, 9, 10, 12–14, 21, 25, 27]. Permutation trinomials over finite fields are in particular interesting for their simple algebraic form and arXiv:1605.06216v1 [cs.IT] 20 May 2016 additional extraordinary properties.
    [Show full text]
  • Polynomial Functions and Permutation Polynomials Over Some Finite Commutative Rings
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector ARTICLE IN PRESS Journal of Number Theory 105 (2004) 192–202 http://www.elsevier.com/locate/jnt Polynomial functions and permutation polynomials over some finite commutative rings$ Qifan Zhang College of Mathematics, Sichuan University, Chengdu 610064, China Received 18 July 2003 Communicated by S.-W. Zhang Abstract We extend some classical results on polynomial functions mod pl: We prove all results in algebraic methods avoiding any combinatorial calculation. As applications of our methods, we obtain some interesting new results on permutation polynomials in several variables over some finite commutative rings. r 2003 Elsevier Inc. All rights reserved. Keywords: Polynomial function; Permutation polynomial; Witt polynomial; Teichmu¨ ller element 1. Introduction We are interested in polynomial functions and permutation polynomials over finite commutative rings. Without loss of generality, we need only to consider local rings, for example, the ring Z=plZ: The polynomial functions over Z=plZ are widely used in the literature on finite combinatorics (see e.g. [1,2,11]). It is well-known that each function over a finite field is a polynomial function. One should ask when a function f over Z=plZ is a polynomial function. A clear necessary condition, easily l derived from Taylor’s formula, is that there exist functions fi over Z=p Z; i ¼ 0; 1; y; l À 1 such that for any x; sAZ=plZ; the following equality holds: lÀ1 f ðx þ psÞ¼f0ðxÞþf1ðxÞps þ ? þ flÀ1ðxÞðpsÞ : $This work is supported by NSFC (10128103,19901023).
    [Show full text]
  • Permutation Polynomial Interleavers
    1 Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective Oscar Y. Takeshita Dept. of Electrical and Computer Engineering 2015 Neil Avenue The Ohio State University Columbus, OH 43210 [email protected] Submitted to the IEEE Transactions on Information Theory January 12, 2006 Abstract An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic con- structions are important because they admit analytical designs and simple, practical hardware implementation. The spread factor of an interleaver is a common measure for turbo coding applications. Maximum-spread interleavers are interleavers whose spread factors achieve the upper bound. An infinite sequence of quadratic permutation poly- nomials over integer rings that generate maximum-spread interleavers is presented. New properties of permutation polynomial interleavers are investigated from an algebraic-geometric perspective resulting in a new non-linearity metric for interleavers. A new interleaver metric that is a function of both the non-linearity metric and the spread factor is proposed. It is numerically demonstrated that the spread factor has a diminishing importance with the block length. A table of good interleavers for a variety of interleaver lengths according to the new metric is listed. Extensive computer simulation results with impressive frame error rates confirm the efficacy of the new metric. Further, when tail-biting constituent codes are used, the resulting turbo codes are quasi-cyclic. Index Terms algebraic, geometry, interleaver, permutation polynomial, quadratic, quasi-cyclic, spread, turbo code. arXiv:cs/0601048v1 [cs.IT] 12 Jan 2006 2 I. INTRODUCTION Interleavers for turbo codes [1]–[14] have been extensively investigated. However, the design of inter- leavers for turbo codes is complex enough and we believe there are still several relevant open questions.
    [Show full text]
  • A Classification of Permutation Polynomials Through Some Linear
    A Classification of Permutation Polynomials through some linear maps Megha M. Kolhekar, Harish K. Pillai {meghakolhekar, hp}@ee.iitb.ac.in Department of Electrical Engineering, IIT Bombay India November 12, 2019 Abstract In this paper, we propose linear maps over the space of all polyno- mials f(x) in Fq[x] that map 0 to itself, through their evaluation map. Properties of these linear maps throw up interesting connections with per- mutation polynomials. We study certain properties of these linear maps. We propose to classify permutation polynomials by identifying the gen- eralized eigenspaces of these maps, where the permutation polynomials reside. As it turns out, several classes of permutation polynomials stud- ied in literature neatly fall into classes defined using these linear maps. We characterize the shapes of permutation polynomials that appear in the various generalized eigenspaces of these linear maps. For the case of Fp, these generalized eigenspaces provide a degree-wise distribution of poly- nomials (and therefore permutation polynomials) over Fp. We show that for Fq, it is sufficient to consider only a few of these linear maps. The intersection of the generalized eigenspaces of these linear maps contain (permutation) polynomials of certain shapes. In this context, we study a F class of permutation polynomials over p2 . We show that the permutation polynomials in this class are closed under compositional inverses. We also do some enumeration of permutation polynomials of certain shapes. arXiv:1911.03689v1 [math.NT] 9 Nov 2019 1 Introduction and Related Work Permutation polynomials (PPs) are important in cryptography, combina- torics and coding theory, to name a few areas.
    [Show full text]
  • Constructions of Rank Modulation Codes That Are Useful for Error Correction in Powerline Communication
    1 Constructions of Rank Modulation Codes Arya Mazumdar∗, Alexander Barg§ and Gilles Z´emora Abstract—Rank modulation is a way of encoding information the drift in different cells may occur at different speed, errors to correct errors in flash memory devices as well as impulse introduced in the data are adequately accounted for by tracking noise in transmission lines. Modeling rank modulation involves the relative value of adjacent cells rather than the absolute construction of packings of the space of permutations equipped with the Kendall tau distance. values of cell charges. Storing information in relative values We present several general constructions of codes in permuta- of the charges also simplifies the rewriting of the data because tions that cover a broad range of code parameters. In particular, we do not need to reach any particular value of the charge as we show a number of ways in which conventional error-correcting long as we have the desired ranking, thereby reducing the risk codes can be modified to correct errors in the Kendall space. of overprogramming. Based on these ideas, Jiang et al. [14], Codes that we construct afford simple encoding and decoding algorithms of essentially the same complexity as required to [15] suggested to use the rank modulation scheme for error- correct errors in the Hamming metric. For instance, from binary correcting coding of data in flash memories. A similar noise BCH codes we obtain codes correcting t Kendall errors in n model arises in transmission over channels subject to impulse t memory cells that support the order of n!/(log2 n!) messages, noise that changes the value of the signal substantially but for any constant t = 1, 2,...
    [Show full text]
  • PERMUTATION BINOMIALS OVER FINITE FIELDS 1. Introduction A
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 361, Number 8, August 2009, Pages 4169–4180 S 0002-9947(09)04578-4 Article electronically published on March 17, 2009 PERMUTATION BINOMIALS OVER FINITE FIELDS ARIANE M. MASUDA AND MICHAEL E. ZIEVE Abstract. m n F We prove that if x + ax permutes the√ prime field p,where ∈ F∗ − − − m>n>0anda p,thengcd(m n, p 1) > p 1. Conversely, we prove that if q ≥ 4andm>n>0 are fixed and satisfy gcd(m − n, q − 1) > 2q(log log q)/ log q, then there exist permutation binomials over Fq of the form xm + axn if and only if gcd(m, n, q − 1) = 1. 1. Introduction A polynomial over a finite field is called a permutation polynomial if it permutes the elements of the field. These polynomials first arose in work of Betti [1] and Hermite [10] as a way to represent permutations. A general theory was developed by Hermite [10] and Dickson [6], with many subsequent developments by Carlitz and others. The simplest class of nonconstant polynomials are the monomials m m x with m>0, and one easily checks that x permutes Fq if and only if m is coprime to q − 1. However, already for binomials the situation becomes much more mysterious. Some examples occurred in Hermite’s work [10], and Mathieu [17] pi i showed that x − ax permutes Fq whenever a is not a (p − 1)-th power in Fq;here p denotes the characteristic of Fq. A general nonexistence result was proved by Niederreiter and Robinson [20] and improved by Turnwald [28]: m n F ∈ F∗ Theorem 1.1.
    [Show full text]
  • The Structure of a Group of Permutation Polynomials
    J. Austral. Math. Soc. (Series A) 38 (1985), 164-170 THE STRUCTURE OF A GROUP OF PERMUTATION POLYNOMIALS GARY L. MULLEN and HARALD MEDERREITER (Received 24 November 1983; revised 31 January 1984) Communicated by R. Lidl Abstract Let Gq be the group of permutations of the finite field Fq of odd order q that can be represented by iq+v>/2 polynomials of the form ax + bx with a, b e Fq. It is shown that Gq is isomorphic to the regular wreath product of two cyclic groups. The structure of Gq can also be described in terms of cyclic, dicyclic, and dihedral groups. It also turns out that Gq is isomorphic to the symmetry group of a regular complex polygon. 1980 Mathematics subject classification (Amer. Math. Soc): 12 C 05, 20 B 25, 20 E 22, 51 F 15 1. Introduction Let F be the finite field of order q. Then every mapping from Fq into itself can be uniquely represented by a polynomial in Fq[x] of degree less than q, and composition of mappings corresponds to composition of polynomials mod(jc* — x) (see [9, Chapter 7]). In particular, every group of permutations of Fq can be represented by a set of polynomials in Fq[x] of degree less than q that is closed under composition vao&(xq — x). According to a well-known definition (see [8, Chapter 4], [9, Chapter 7]), a polynomial / over Fq for which the corresponding polynomial mapping c e Fq -* f(c) is a permutation is called a permutation polynomial of Fq. Numerous papers have been written on the structure of permutation groups represented by a given group of permutation polynomials of F under composition mod(x'7 — x); see for example Carlitz [1], > 1985 Australian Mathematical Society 0263-6115/85 $A2.00 + 0.00 164 Downloaded from https://www.cambridge.org/core.
    [Show full text]
  • 8.3 Value Sets of Polynomials
    Permutation polynomials 225 arbitrary subfields of the finite field. The results developed in this paper are used to con- struct additional complete sets of frequency squares, rectangles and hyperrectangles, and orthogonal arrays. Some of the theorems present a relationship between permutation poly- nomials of a finite field and field permutation functions, an implicit bound on the possible number of functions in an orthogonal field system, and results related to the generation of orthogonal field systems. 8.2.21 Remark For finite rings there are two concepts to distinguish: permutation polynomials (as above) and strong permutation polynomials. The latter are defined via the cardinality of the inverse image. Polynomials are strong permutation polynomials (or strong orthogonal systems) in n variables if they can be completed to an orthogonal system of n polynomials in n variables. 8.2.22 Theorem [1129] If R is a local ring whose maximal ideal has a minimal number m of generators, then for every n > m there exists a permutation polynomial in n variables that is not a strong permutation polynomial. 8.2.23 Corollary [1129] Every permutation polynomial in any number of variables over a local ring R is strong if and only if R is a finite field. 8.2.24 Remark Wei and Zhang showed [2954] that if n m in the setting of Theorem 8.2.22, then every orthogonal system of k polynomials in n variables≤ can be completed to an orthogonal system of n polynomials (and in particular, every permutation polynomial is strong). See Also 9.4 Considers κ-polynomials used for constructions of semifields.
    [Show full text]
  • Finding Nice Permutation Polynomials Over Finite Fields
    Finding Nice Permutation Polynomials over Finite Fields By Karl Wallulis A MTH 501 – Mathematical Literature Project Under the direction of Dr. John Caughman IV 2nd Reader: Dr. Derek Garton Submitted in partial fulfillment of the requirements for the degree of Masters of Science in Mathematics Portland State University Fariborz Maseeh Department of Mathematics & Statistics June 16, 2017 Wallulis 2 Introduction. A polynomial over a finite field 픽q is defined to be a permutation polynomial if it permutes the elements of the field. Permutation polynomials were first studied by Betti, Mathieu and Hermite as a way of representing permutations. In this mathematical literature project, we work through a 2008 paper by Michael E. Zieve [1] that describes a set of necessary and sufficient conditions under which a specific family of polynomials over 푟 푣 푡 푘−1 a finite field 픽q of the form 푓(푥) = 푥 ℎ푘(푥 ) permutes the field, where ℎ푘(푥) ∶= 푥 + 푥푘−2 + ⋯ + 1 and r, k, v and t are positive integers. These results coincide with those of previous authors in special cases, but with simpler proofs. §1 Families of “nice” permutation polynomials. Recent attention has been focused on finding permutation polynomials of “nice” 푢 forms. Akbary, Q. Wang and L. Wang [2, 3] studied binomials in 픽q of the form 푓(푥) = 푥 + 푥푟, with the condition that 푑 ∶= gcd(푞 − 1, 푢 − 푟) satisfies (푞 − 1)/푑 ∈ {3, 5, 7}. They found necessary and sufficient conditions for such polynomials to permute 픽q. However, their proofs contained “lengthy calculations involving coefficients of Chebyshev polynomials, lacunary sums of binomial coefficients, determinants of circulant matrices […] among other things” (Zieve pg.
    [Show full text]