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

被引：49

作者：

Niederreiter, H ^{[1
]}

机构：

[1] Natl Univ Singapore, Dept Math, Singapore 117543, Singapore

来源：

FINITE FIELDS AND THEIR APPLICATIONS | 2005年 / 11卷 / 03期

关键词：

net; (t; s)-sequence; digital net; digital; duality theory for digital nets; ordered orthogonal array; polynomial lattice; scrambled net; scrambled; quasi-Monte Carlo method;

D O I：

10.1016/j.ffa.2005.01.001

中图分类号：

O29 [应用数学];

学科分类号：

070104 [应用数学];

摘要：

We present a survey of constructions of (t, m, s)-nets and (t, s)-sequences. The emphasis is on work since about 1998 when a previous survey on the same topic was written. (c) 2005 Elsevier Inc. All rights reserved.

引用

页码：578 / 600

页数：23

共 81 条

[1]

[Anonymous], 1999, GEOMETRIC DISCREPANC

[2]

[Anonymous], 1999, LOND MATH SOC LECT N

[3]

[Anonymous], APPL MATH ENT 21 CEN

[4]

[Anonymous], 1999, STRATEGIES QUASIMONT

[5]

Atanassov EI, 2003, LECT NOTES COMPUT SC, V2542, P83

[6]

Coding-theoretic constructions for (t,m,s)-nets and ordered orthogonal arrays [J].

Bierbrauer, J ;

Edel, Y ;

Schmid, WC .

JOURNAL OF COMBINATORIAL DESIGNS, 2002, 10 (06) :403-418

[7]

Clayman AT, 1999, J COMB DES, V7, P381, DOI 10.1002/(SICI)1520-6610(1999)7:5<381::AID-JCD7>3.0.CO

[8]

2-S

[9]

The number of linearly independent binary vectors with applications to the construction of hypercubes and orthogonal arrays, pseudo (t, m, s)-nets and linear codes [J].

Damelin, SB ;

Michalski, G ;

Mullen, GL ;

Stone, D .

MONATSHEFTE FUR MATHEMATIK, 2004, 141 (04) :277-288

[10]

DICK J, 2004, WEIGHTED STAR DISCRE

← 1 2 3 4 5 6 7 8 9 →