Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
16 - Index bounds for value sets of polynomials over finite fields
Published online by Cambridge University Press: 18 December 2014
Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Applied Algebra and Number Theory , pp. 280 - 296Publisher: Cambridge University PressPrint publication year: 2014
References
[1] and , On some permutation polynomials. Int. J. Math. Math. Sci. 16, 2631–2640, 2005.Google Scholar
[2] and , A generalized Lucas sequence and permutation binomials. Proc. Am. Math. Soc. 134(1), 15–22, 2006.Google Scholar
[3] and , On polynomials of the form xrf(x(q−1)/l). Int. J. Math. Math. Sci. 2007, 23408, 2007.Google Scholar
[4] , and , On some classes of permutation polynomials. Int. J. Number Theory 4(1), 121–133, 2008.Google Scholar
[5] , and , On permutation polynomials of prescribed shape. Finite Fields Appl. 15, 195–206, 2009.Google Scholar
[6] , and , On constructing permutations of finite fields, Finite Fields Appl. 17(1), 51–67, 2011.Google Scholar
[8] and , On the characterization of minimal value set polynomials. J. Number Theory 133, 2021–2035, 2013.Google Scholar
[9] and , New methods for generating permutation polynomials over finite fields. Finite Fields Appl. 17, 493–503, 2011.Google Scholar
[10] , and , Constructing permutation polynomials from piecewise permutations. Finite Fields Appl. 26, 162–174, 2014.Google Scholar
[11] , , and , Polynomials over finite fields with minimal value sets, Mathematika 8, 121–130, 1961.Google Scholar
[12] and , When does F(x) + Tr(H(x)) permute?Finite Fields Appl. 15(5), 615–632, 2009.Google Scholar
[13] , and , Counting value sets: algorithms and complexity. Tenth Algorithmic Number Theory Symposium ANTS-X, University of California at San Deigo, 2012.
[14] , The distribution of polynomials over finite fields. Acta Arith. 17, 255–271, 1970.Google Scholar
[15] and , Value sets of polynomials over finite fields. In: , and (eds.), Finite Fields with Applications in Coding Theory, Cryptography and Related Areas, pp. 80–85. Springer, 2002.
[16] , Orthomorphism Graphs of Groups, Lecture Notes in Mathematics, volume 1535. Springer, Berlin, 1992.
[17] and , A piecewise construction of permutation polynomial over finite fields. Finite Fields Appl. 18, 1184–1194, 2012.Google Scholar
[18] and , Polynomials with small value set over finite fields. J. Number Theory 28(2), 167–188, 1988.Google Scholar
[19] and , Bounds for fixed point free elements in a transitive group and applications to curves over finite fields. Isr. J. Math. 101, 255–287, 1997.Google Scholar
[20] , Two classes of permutation polynomials over finite fields. J. Comb. Theory Ser. A 118(2), 448–454, 2011.Google Scholar
[21] , Permutation polynomials and applications to coding theory. Finite Fields Appl. 13, 58–70, 2007.Google Scholar
[22] and , When does a polynomial over a finite field permute the elements of the field?Am. Math. Monthly 95, 243–246, 1988.Google Scholar
[23] and , When does a polynomial over a finite field permute the elements of the field? II. Am. Math. Monthly 100, 71–74, 1993.Google Scholar
[24] and , Finite Fields, second edition. Cambridge University Press, Cambridge, 1997.
[25] , Claiming Picard's math may have gaps, http://rjlipton.wordpress.com/2011/09/26/claiming-picards-math-may-have-gaps/.
[26] and , Permutation binomials over finite fields. Trans. Am. Math. Soc. 361(8), 4169–4180, 2009.Google Scholar
[28] , Permutation polynomials over finite fields. Finite Fields, Coding Theory, and Advances in Communications and Computing. Lecture Notes in Pure and Applied Mathematics, volume 141, pp. 131–151. Marcel Dekker, New York, 1992.
[29] and , Handbook of Finite Fields. CRC Press, Boca Raton, FL, 2013.
[30] and , Permutation polynomials of one variable. In: and (eds.), Handbook of Finite Fields, Section 8.1. CRC Press, Boca Raton, FL, 2013.
[31] , and , Value sets of polynomial maps over finite fields, Q. J. Math. 64(4), 1191–1196, 2013.Google Scholar
[32] and , Cyclotomic R-orthomorphisms of finite fields. Discrete Math. 295, 161–171, 2005.Google Scholar
[33] , A new criterion for permutation polynomials. Finite Fields Appl. 1, 64–82, 1995.Google Scholar
[34] , A p-adic lifting lemma and its applications to permutation polynomials. Finite Fields, Coding Theory, and Advances in Communications and Computing. Lecture Notes in Pure and Applied Mathematics, volume 141, pp. 209–216. Marcel Dekker, New York, 1992.
[35] and , Permutation polynomials of the form xrf(x(q−1)/d) and their group structure. Monatsh. Math. 112, 149–163, 1991.Google Scholar
[36] , and , Value sets of polynomials over finite fields. Proc. Am. Math. Soc. 119, 711–717, 1993.Google Scholar
[37] , Cyclotomic mapping permutation polynomials over finite fields. Sequences, Subsequences, and Consequences (International Workshop, SSC 2007, Los Angeles, CA, May 31–June 2, 2007), Lecture Notes in Computer Science, volume 4893, pp. 119–128. Springer, Berlin, 2007.
[38] , Cyclotomy and permutation polynomials of large indices. Finite Fields Appl. 22, 57–69, 2013.Google Scholar
[40] and , Permutation polynomials over finite fields from a powerful lemma. Finite Fields Appl. 17(6), 560–574, 2011.Google Scholar
[41] and , Further results on permutation polynomials over finite fields. Finite Fields Appl. 27, 88–103, 2014.Google Scholar
[42] and , Two classes of permutation polynomials over finite fields. Finite Fields Appl. 18(4), 781–790, 2012.Google Scholar
[43] , Some families of permutation polynomials over finite fields. Int. J. Number Theory 4, 851–857, 2008.Google Scholar
[44] , On some permutation polynomials over Fq of the form xrh(x(q−1)/d). Proc. Am. Math. Soc. 137(7), 2209–2216, 2009.Google Scholar
[45] , Classes of permutation polynomials based on cyclotomy and an additive analogue. Additive Number Theory, pp. 355–361. Springer, New York, 2010.
- 4
- Cited by