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
17 - Rational points of the curve over
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. 297 - 306Publisher: Cambridge University PressPrint publication year: 2014
References
[2] , and , Generalized Hamming weights for duals of BCH, and maximal algebraic function fields. In: , and (eds.), Arithmetic Geometry and Coding Theory, pp. 53–65. de Gruyter, Berlin, 1996.
[3] and , Improvements on generalized Hamming weights of some trace codes. Des. Codes Cryptogr. 39(2), 215–231, 2006.Google Scholar
[4] and , Weil–Serre type bounds for cyclic codes. IEEE Trans. Inf. Theory 54(1), 5381–5395, 2008.Google Scholar
[5] , Cross-correlations of quadratic form sequences in odd characteristic. Des. Codes Cryptogr. 11(3), 289–305, 1997.Google Scholar
[6] and , Finite Fields. Cambridge University Press, Cambridge, 1997.
[7] and , Rational Points on Curves over Finite Fields: Theory and Applications. Cambridge University Press, Cambridge, 2001.
[8] and , Algebraic Geometry in Coding Theory and Cryptography. Princeton University Press, Princeton, NJ, 2009.
[9] , Algebraic Function Fields and Codes. Springer-Verlag, Berlin, 2009.
[10] , and , Algebraic Geometric Codes: Basic Notions. American Mathematical Society, Providence, RI, 2007.