Applied Algebra and Number Theory
Herausgeber: Larcher, Gerhard; Winterhof, Arne; Pillichshammer, Friedrich
Applied Algebra and Number Theory
Herausgeber: Larcher, Gerhard; Winterhof, Arne; Pillichshammer, Friedrich
- Gebundenes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
This book contains survey articles on modern topics related to the work of Harald Niederreiter, written by close colleagues and leading experts.
This book contains survey articles on modern topics related to the work of Harald Niederreiter, written by close colleagues and leading experts.
Produktdetails
- Produktdetails
- Verlag: Cambridge University Press
- Seitenzahl: 354
- Erscheinungstermin: 11. Dezember 2014
- Englisch
- Abmessung: 235mm x 157mm x 24mm
- Gewicht: 664g
- ISBN-13: 9781107074002
- ISBN-10: 1107074002
- Artikelnr.: 41151247
- Herstellerkennzeichnung
- Libri GmbH
- Europaallee 1
- 36244 Bad Hersfeld
- gpsr@libri.de
- Verlag: Cambridge University Press
- Seitenzahl: 354
- Erscheinungstermin: 11. Dezember 2014
- Englisch
- Abmessung: 235mm x 157mm x 24mm
- Gewicht: 664g
- ISBN-13: 9781107074002
- ISBN-10: 1107074002
- Artikelnr.: 41151247
- Herstellerkennzeichnung
- Libri GmbH
- Europaallee 1
- 36244 Bad Hersfeld
- gpsr@libri.de
Preface Gerhard Larcher, Friedrich Pillichshammer, Arne Winterhof and Chaoping Xing; 1. Some highlights of Harald Niederreiter's work Gerhard Larcher, Friedrich Pillichshammer, Arne Winterhof and Chaoping Xing; 2. Partially bent functions and their properties Ayça Çe
meliölu, Wilfried Meidl and Alev Topuzölu; 3. Applications of geometric discrepancy in numerical analysis and statistics Josef Dick; 4. Discrepancy bounds for low-dimensional point sets Henri Faure and Peter Kritzer; 5. On the linear complexity and lattice test of nonlinear pseudorandom number generators Domingo Gómez-Pérez and Jaime Gutierrez; 6. A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack Rainer Göttfert; 7. Point sets of minimal energy Peter J. Grabner; 8. The cross-correlation measure for families of binary sequences Katalin Gyarmati, Christian Mauduit and András Sárközy; 9. On an important family of inequalities of Niederreiter involving exponential sums Peter Hellekalek; 10. Controlling the shape of generating matrices in global function field constructions of digital sequences Roswitha Hofer and Isabel Pirsic; 11. Periodic structure of the exponential pseudorandom number generator Jonas Kaszián, Pieter Moree and Igor E. Shparlinski; 12. Construction of a rank-1 lattice sequence based on primitive polynomials Alexander Keller, Nikolaus Binder and Carsten Wächter; 13. A quasi-Monte Carlo method for the coagulation equation Christian Lécot and Ali Tarhini; 14. Asymptotic formulae for partitions with bounded multiplicity Pierre Liardet and Alain Thomas; 15. A trigonometric approach for Chebyshev polynomials over finite fields Juliano B. Lima, Daniel Panario and Ricardo M. Campello de Souza; 16. Index bounds for value sets of polynomials over finite fields Gary L. Mullen, Daqing Wan and Qiang Wang; 17. Rational points of the curve yqn
y =
xqh+1
over Fqm Ferruh Özbudak and Zülfükar Saygi; 18. On the linear complexity of multisequences, bijections between Zahlen and number tuples, and partitions Michael Vielhaber.
meliölu, Wilfried Meidl and Alev Topuzölu; 3. Applications of geometric discrepancy in numerical analysis and statistics Josef Dick; 4. Discrepancy bounds for low-dimensional point sets Henri Faure and Peter Kritzer; 5. On the linear complexity and lattice test of nonlinear pseudorandom number generators Domingo Gómez-Pérez and Jaime Gutierrez; 6. A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack Rainer Göttfert; 7. Point sets of minimal energy Peter J. Grabner; 8. The cross-correlation measure for families of binary sequences Katalin Gyarmati, Christian Mauduit and András Sárközy; 9. On an important family of inequalities of Niederreiter involving exponential sums Peter Hellekalek; 10. Controlling the shape of generating matrices in global function field constructions of digital sequences Roswitha Hofer and Isabel Pirsic; 11. Periodic structure of the exponential pseudorandom number generator Jonas Kaszián, Pieter Moree and Igor E. Shparlinski; 12. Construction of a rank-1 lattice sequence based on primitive polynomials Alexander Keller, Nikolaus Binder and Carsten Wächter; 13. A quasi-Monte Carlo method for the coagulation equation Christian Lécot and Ali Tarhini; 14. Asymptotic formulae for partitions with bounded multiplicity Pierre Liardet and Alain Thomas; 15. A trigonometric approach for Chebyshev polynomials over finite fields Juliano B. Lima, Daniel Panario and Ricardo M. Campello de Souza; 16. Index bounds for value sets of polynomials over finite fields Gary L. Mullen, Daqing Wan and Qiang Wang; 17. Rational points of the curve yqn
y =
xqh+1
over Fqm Ferruh Özbudak and Zülfükar Saygi; 18. On the linear complexity of multisequences, bijections between Zahlen and number tuples, and partitions Michael Vielhaber.
Preface Gerhard Larcher, Friedrich Pillichshammer, Arne Winterhof and Chaoping Xing; 1. Some highlights of Harald Niederreiter's work Gerhard Larcher, Friedrich Pillichshammer, Arne Winterhof and Chaoping Xing; 2. Partially bent functions and their properties Ayça Çe
meliölu, Wilfried Meidl and Alev Topuzölu; 3. Applications of geometric discrepancy in numerical analysis and statistics Josef Dick; 4. Discrepancy bounds for low-dimensional point sets Henri Faure and Peter Kritzer; 5. On the linear complexity and lattice test of nonlinear pseudorandom number generators Domingo Gómez-Pérez and Jaime Gutierrez; 6. A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack Rainer Göttfert; 7. Point sets of minimal energy Peter J. Grabner; 8. The cross-correlation measure for families of binary sequences Katalin Gyarmati, Christian Mauduit and András Sárközy; 9. On an important family of inequalities of Niederreiter involving exponential sums Peter Hellekalek; 10. Controlling the shape of generating matrices in global function field constructions of digital sequences Roswitha Hofer and Isabel Pirsic; 11. Periodic structure of the exponential pseudorandom number generator Jonas Kaszián, Pieter Moree and Igor E. Shparlinski; 12. Construction of a rank-1 lattice sequence based on primitive polynomials Alexander Keller, Nikolaus Binder and Carsten Wächter; 13. A quasi-Monte Carlo method for the coagulation equation Christian Lécot and Ali Tarhini; 14. Asymptotic formulae for partitions with bounded multiplicity Pierre Liardet and Alain Thomas; 15. A trigonometric approach for Chebyshev polynomials over finite fields Juliano B. Lima, Daniel Panario and Ricardo M. Campello de Souza; 16. Index bounds for value sets of polynomials over finite fields Gary L. Mullen, Daqing Wan and Qiang Wang; 17. Rational points of the curve yqn
y =
xqh+1
over Fqm Ferruh Özbudak and Zülfükar Saygi; 18. On the linear complexity of multisequences, bijections between Zahlen and number tuples, and partitions Michael Vielhaber.
meliölu, Wilfried Meidl and Alev Topuzölu; 3. Applications of geometric discrepancy in numerical analysis and statistics Josef Dick; 4. Discrepancy bounds for low-dimensional point sets Henri Faure and Peter Kritzer; 5. On the linear complexity and lattice test of nonlinear pseudorandom number generators Domingo Gómez-Pérez and Jaime Gutierrez; 6. A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack Rainer Göttfert; 7. Point sets of minimal energy Peter J. Grabner; 8. The cross-correlation measure for families of binary sequences Katalin Gyarmati, Christian Mauduit and András Sárközy; 9. On an important family of inequalities of Niederreiter involving exponential sums Peter Hellekalek; 10. Controlling the shape of generating matrices in global function field constructions of digital sequences Roswitha Hofer and Isabel Pirsic; 11. Periodic structure of the exponential pseudorandom number generator Jonas Kaszián, Pieter Moree and Igor E. Shparlinski; 12. Construction of a rank-1 lattice sequence based on primitive polynomials Alexander Keller, Nikolaus Binder and Carsten Wächter; 13. A quasi-Monte Carlo method for the coagulation equation Christian Lécot and Ali Tarhini; 14. Asymptotic formulae for partitions with bounded multiplicity Pierre Liardet and Alain Thomas; 15. A trigonometric approach for Chebyshev polynomials over finite fields Juliano B. Lima, Daniel Panario and Ricardo M. Campello de Souza; 16. Index bounds for value sets of polynomials over finite fields Gary L. Mullen, Daqing Wan and Qiang Wang; 17. Rational points of the curve yqn
y =
xqh+1
over Fqm Ferruh Özbudak and Zülfükar Saygi; 18. On the linear complexity of multisequences, bijections between Zahlen and number tuples, and partitions Michael Vielhaber.