论文信息 - Matrix-product constructions of digital nets

Matrix-product constructions of digital nets

We present a new construction of digital nets, and more generally of (d,k,m,s)-systems, over finite fields which is an analog of the matrix-product construction of codes. Examples show that this construction can yield digital nets with better parameters compared to competing constructions.

Harald Niederreiter | Ferruh Özbudak

[1] H. Niederreiter,et al. Duality for digital nets and its applications , 2001 .

[2] Harald Niederreiter. Constructions of (t, m, s)-Nets , 2000 .

[3] Harald Niederreiter,et al. Constructions of digital nets using global function fields , 2002 .

[4] H. Niederreiter,et al. Rational Points on Curves Over Finite Fields: Theory and Applications , 2001 .

[5] Harald Niederreiter,et al. Monte-Carlo and Quasi-Monte Carlo Methods 1998 , 2000 .

[6] Fred J. Hickernell,et al. Monte Carlo and Quasi-Monte Carlo Methods 2000 , 2002 .

[7] G. Larcher. Digital Point Sets: Analysis and Application , 1998 .

[8] Graham H. Norton,et al. Matrix-Product Codes over ?q , 2001, Applicable Algebra in Engineering, Communication and Computing.

[9] Y. Edel,et al. Coding‐theoretic constructions for (t,m,s)‐nets and ordered orthogonal arrays , 2002 .

[10] Harald Niederreiter,et al. Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[11] Harald Neiderreiter. A combinatorial problem for vector spaces over finite fields , 1991 .

[12] H. Niederreiter,et al. A Kronecker Product Construction for Digital Nets , 2002 .