Harald Niederreiter

Finite Fields Their Appl., 2020

2018

On the Expansion Complexity of Sequences Over Finite Fields.

[BibT_eX]

[DOI]

Domingo Gómez-Pérez

László Mérai

IEEE Trans. Inf. Theory, 2018

2017

Recent constructions of low-discrepancy sequences.

[BibT_eX]

[DOI]

Math. Comput. Simul., 2017

Expansion complexity and linear complexity of sequences over finite fields.

[BibT_eX]

[DOI]

László Mérai

Cryptogr. Commun., 2017

2016

Mixed orthogonal arrays, -nets, and -sequences.

[BibT_eX]

[DOI]

Peter Kritzer

Discret. Math., 2016

A survey of some applications of finite fields.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2016

Multisequences with high joint nonlinear complexity.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2016

2015

Propagation rules for (u,m,e,s)-nets and (u,e,s)-sequences.

[BibT_eX]

[DOI]

Peter Kritzer

J. Complex., 2015

Guest Editors' Preface.

[BibT_eX]

[DOI]

J. Complex., 2015

2014

Sequences With High Nonlinear Complexity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Van der Corput and Golden Ratio Sequences Along the Hilbert Space-Filling Curve.

[BibT_eX]

[DOI]

Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2014

Vandermonde Nets and Vandermonde Sequences.

[BibT_eX]

[DOI]

Roswitha Hofer

Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2014

2013

A direct inversion method for non-uniform quasi-random point sequences.

[BibT_eX]

[DOI]

Colas Schretter

Monte Carlo Methods Appl., 2013

Finite Fields and Quasirandom Points.

[BibT_eX]

Proceedings of the Finite Fields and Their Applications - Character Sums and Polynomials., 2013

Algebraic-geometry codes.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

(t, m, s)-nets and (t, s)-sequences.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

LFSR sequences and maximal period sequences.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

2012

The independence of two randomness properties of sequences over finite fields.

[BibT_eX]

[DOI]

J. Complex., 2012

Improved results on the probabilistic theory of the joint linear complexity of multisequences.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2012

2010

Improved results on periodic multisequences with large error linear complexity.

[BibT_eX]

[DOI]

Ayineedi Venkateswarlu

Finite Fields Their Appl., 2010

2009

Duality for digital sequences.

[BibT_eX]

[DOI]

Josef Dick

J. Complex., 2009

Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2009

Joint linear complexity of multisequences consisting of linear recurring sequences.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2009

2008

Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences.

[BibT_eX]

[DOI]

J. Complex., 2008

On the exact t-value of Niederreiter and Sobol' sequences.

[BibT_eX]

[DOI]

Josef Dick

J. Complex., 2008

Exponential sums for nonlinear recurring sequences.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2008

Periodic multisequences with large error linear complexity.

[BibT_eX]

[DOI]

Ayineedi Venkateswarlu

Des. Codes Cryptogr., 2008

Function-field codes.

[BibT_eX]

[DOI]

Dirk Hachenberger

Appl. Algebra Eng. Commun. Comput., 2008

2007

Cyclotomic Linear Codes of Order 3.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Error linear complexity measures for multisequences.

[BibT_eX]

[DOI]

Ayineedi Venkateswarlu

J. Complex., 2007

On the counting function of the lattice profile of periodic sequences.

[BibT_eX]

[DOI]

J. Complex., 2007

Further improvements on asymptotic bounds for codes using distinguished divisors.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2007

On the Structure of Inversive Pseudorandom Number Generators.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2007

2006

Probability and computing: randomized algorithms and probabilistic analysis.

[BibT_eX]

[DOI]

Math. Comput., 2006

Enumeration results on the joint linear complexity of multisequences.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2006

On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots.

[BibT_eX]

[DOI]

San Ling

Patrick Solé

Des. Codes Cryptogr., 2006

Authentication Schemes from Highly Nonlinear Functions.

[BibT_eX]

[DOI]

Claude Carlet

Des. Codes Cryptogr., 2006

The Probabilistic Theory of the Joint Linear Complexity of Multisequences.

[BibT_eX]

[DOI]

Proceedings of the Sequences and Their Applications, 2006

The Characterization of 2n-Periodic Binary Sequences with Fixed 1-Error Linear Complexity.

[BibT_eX]

[DOI]

Ming Su

Proceedings of the Sequences and Their Applications, 2006

2005

The expectation and variance of the joint linear complexity of random periodic multisequences.

[BibT_eX]

[DOI]

Ming Su

J. Complex., 2005

Constructions of (t, m, s)-nets and (t, s)-sequences.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2005

Cyclotomic R-orthomorphisms of finite fields.

[BibT_eX]

[DOI]

Discret. Math., 2005

Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2005

2004

Disjoint Linear Codes From Algebraic Function Fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Systematic authentication codes from highly nonlinear functions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

From the Editors.

[BibT_eX]

[DOI]

Joseph F. Traub

Henryk Wozniakowski

J. Complex., 2004

Matrix-product constructions of digital nets.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2004

On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers.

[BibT_eX]

[DOI]

Proceedings of the Sequences and Their Applications, 2004

2003

Periodic sequences with large k-error linear complexity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Some current issues in quasi-Monte Carlo methods.

[BibT_eX]

[DOI]

J. Complex., 2003

The expected value of the joint linear complexity of periodic multisequences.

[BibT_eX]

[DOI]

J. Complex., 2003

The existence of good extensible rank-1 lattices.

[BibT_eX]

[DOI]

Fred J. Hickernell

J. Complex., 2003

Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2003

Linear Complexity and Related Complexity Measures for Sequences.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2003

Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 2003

Dynamical Systems Generated by Rational Functions.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2003

2002

On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

The minimum distance of the duals of binary irreducible cyclic codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

2001 Best Paper Award.

[BibT_eX]

[DOI]

Joseph F. Traub

Henryk Wozniakowski

J. Complex., 2002

Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform.

[BibT_eX]

[DOI]

J. Complex., 2002

Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2002

2001

On a new class of inversive pseudorandom numbers for parallelized simulation methods.

[BibT_eX]

[DOI]

Period. Math. Hung., 2001

On the distribution of inversive congruential pseudorandom numbers in parts of the period.

[BibT_eX]

[DOI]

Math. Comput., 2001

ANNOUNCEMENT: 2000 Best Paper Award.

[BibT_eX]

[DOI]

Joseph F. Traub

Henryk Wozniakowski

J. Complex., 2001

The Microstructure of (t, m, s)-Nets.

[BibT_eX]

[DOI]

Gottlieb Pirsic

J. Complex., 2001

On the Lattice Structure of Pseudorandom Numbers Generated over Arbitrary Finite Fields.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2001

2000

Some new codes from algebraic curves.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

A Propagation Rule for Linear Codes.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2000

On the Distribution of Pseudorandom Numbers and Vectors Generated by Inversive Methods.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2000

1999

A generalization of algebraic-geometry codes.

[BibT_eX]

[DOI]

Kwok-Yan Lam

IEEE Trans. Inf. Theory, 1999

Constructions of Algebraic-Geometry Codes.

[BibT_eX]

[DOI]

Kwok-Yan Lam

IEEE Trans. Inf. Theory, 1999

An Algorithm for Shifted Continued Fraction Expansions in Parallel Linear Time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

A New Construction of Algebraic Geometry Codes.

[BibT_eX]

[DOI]

Kwok-Yan Lam

Appl. Algebra Eng. Commun. Comput., 1999

On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders.

[BibT_eX]

[DOI]

Frances Griffin

Proceedings of the Applied Algebra, 1999

1998

The Weighted Spectral Test: Diaphony.

[BibT_eX]

[DOI]

Peter Hellekalek

ACM Trans. Model. Comput. Simul., 1998

Simultaneous Shifted Continued Fraction Expansions in Quadratic Time.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1998

Counting Functions and Expected Values in the Stability Theory of Stream Ciphers.

[BibT_eX]

[DOI]

Heike Paschinger

Proceedings of the Sequences and their Applications, 1998

Some Computable Complexity Measures for Binary Sequences.

[BibT_eX]

[DOI]

Proceedings of the Sequences and their Applications, 1998

A General Method of Constructing Global Function Fields.

[BibT_eX]

[DOI]

Jürgen Eichenauer-Herrmann

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997

Inversive congruential pseudorandom numbers: distribution of triples.

[BibT_eX]

[DOI]

Math. Comput., 1997

Linear Complexity Profiles: Hausdorff Dimensions for Almost Perfect Profiles and Measures for General Profiles.

[BibT_eX]

[DOI]

J. Complex., 1997

1996

Tree Complexity and a Doubly Exponential Gap between Structured and Random Sequences.

[BibT_eX]

[DOI]

J. Complex., 1996

1995

Some Linear and Nonlinear Methods for Pseudorandom Number Generation.

[BibT_eX]

[DOI]

Proceedings of the 27th conference on Winter simulation, 1995

1994

Programs to generate Niederreiter's low-discrepancy sequences.

[BibT_eX]

[DOI]

Paul Bratley

Bennett L. Fox

ACM Trans. Math. Softw., 1994

Pseudorandom Vector Generation by the Inverse Method.

[BibT_eX]

[DOI]

Jürgen Eichenauer-Herrmann

ACM Trans. Model. Comput. Simul., 1994

Digital Inversive Pseudorandom Numbers.

[BibT_eX]

[DOI]

Jürgen Eichenauer-Herrmann

ACM Trans. Model. Comput. Simul., 1994

On the Statistical Independence of Nonlinear Congruential Pseudorandom Numbers.

[BibT_eX]

[DOI]

ACM Trans. Model. Comput. Simul., 1994

General Lower Bound for the Linear Complexity of the Product of Shift-Register Sequences.

[BibT_eX]

[DOI]

Rainer Göttfert

Proceedings of the Advances in Cryptology, 1994

1993

Local Randomness in Polynomial Random Number and Random Function Generators.

[BibT_eX]

[DOI]

Claus-Peter Schnorr

SIAM J. Comput., 1993

Factorization of Polynomials over Finite Fields and Characteristic Sequences.

[BibT_eX]

[DOI]

Rainer Göttfert

J. Symb. Comput., 1993

Improved Error Bounds for Lattice Rules.

[BibT_eX]

[DOI]

J. Complex., 1993

Proof of Williams' Conjecture on Experimental Designs Balanced for Pairs of Interacting Residual Effects.

[BibT_eX]

[DOI]

Eur. J. Comb., 1993

A New Efficient Factorization Algorithm for Polynomial over Small Finite Fields.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1993

On the Linear Complexity of Products of Shift-Register Sequences.

[BibT_eX]

[DOI]

Rainer Göttfert

Proceedings of the Advances in Cryptology, 1993

1992

Implementation and Tests of Low Discrepancy Sequences.

[BibT_eX]

[DOI]

Paul Bratley

Bennett L. Fox

ACM Trans. Model. Comput. Simul., 1992

Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes.

[BibT_eX]

[DOI]

Discret. Math., 1992

New methods for pseudorandom numbers and pseudorandom vector generation.

[BibT_eX]

[DOI]

Proceedings of the 24th Winter Simulation Conference, 1992

Local Randomness in Candidate One-Way Functions.

[BibT_eX]

[DOI]

Claus-Peter Schnorr

Proceedings of the Advances in Cryptology, 1992

Random number generation and Quasi-Monte Carlo methods.

[BibT_eX]

[DOI]

CBMS-NSF regional conference series in applied mathematics 63, SIAM, ISBN: 978-0-89871-295-7, 1992

1991

A combinatorial problem for vector spaces over finite fields.

[BibT_eX]

[DOI]

Discret. Math., 1991

Recent trends in random number and random vector generation.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1991

1990

A Combinatorial Approach to Probabilistic Results on the Linear Complexity Profile of Random Sequences.

[BibT_eX]

[DOI]

J. Cryptol., 1990

An Enumeration Formula for Certain Irreducible Polynomials with an Application to the Construction of Irreducible Polynomials over the Binary Field.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1990

A Short Proof for Explicit Formulas for Discrete Logarithms in Finite Fields.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1990

The Linear Complexity Profile and the Jump Complexity of Keystream Sequences.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1990

1989

Keysystem Sequences with a Good Linear Complexity Profile for Every STrating Point.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1989

1988

The Probabilistic Theory of Linear Complexity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1988

1987

Optimal characteristic polynomials for digital multistep pseudorandom numbers.

[BibT_eX]

[DOI]

Gary L. Mullen

Computing, 1987

Sequences With Almost Perfect Linear Complexity Profile.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1987

1986

A Cryptanalytic Attack on the CADE Cryptosystem.

[BibT_eX]

N. S. James

Rudolf Lidl

EUROCRYPT, 1986

Breaking the Cade Cipher.

[BibT_eX]

[DOI]

N. S. James

Rudolf Lidl

Proceedings of the Advances in Cryptology, 1986

1985

A Public-Key Cryptosystem based on Shift Register Sequences.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1985

1979

Optimization of functions by quasi-random search methods.

[BibT_eX]

[DOI]

Kevin S. McCurley

Computing, 1979

1977

Weights of Cyclic Codes

[BibT_eX]

[DOI]