Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. J. Bierbrauer. A direct approach to linear programming bounds for codes and tms-nets. Des. Codes Cryptogr., 42:127–143, 2007.
2. A. García and H. Stichtenoth. A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound. Invent. Math., 121:211–222, 1995.
3. K. M. Lawrence. Combinatorial Bounds and Constructions in the Theory of Uniform Point Distributions in Unit Cubes, Connections with Orthogonal Arrays and a Poset Generalization of a Related Problem in Coding Theory. PhD thesis, University of Wisconsin, Madison, 1995.
4. K. M. Lawrence. A combinatorial characterization of (t, m, s)-nets in base b. J. Combin. Des., 4:275–293, 1996.
5. G. Larcher and W. Ch. Schmid. Multivariate Walsh series, digital nets and quasi-Monte Carlo integration. In H. Niederreiter and P. J.-S. Shiue, editors, Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, volume 106 of Lecture Notes in Statistics, pages 252–262. Springer-Verlag, Berlin, 1995.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Digital Almost Nets;The Electronic Journal of Combinatorics;2022-11-18
2. On convex holes in d-dimensional point sets;Combinatorics, Probability and Computing;2021-06-18
3. Recent constructions of low-discrepancy sequences;Mathematics and Computers in Simulation;2017-05
4. Vandermonde Nets and Vandermonde Sequences;Springer Proceedings in Mathematics & Statistics;2016
5. A construction of(t,s)-sequences with finite-row generating matrices using global function fields;Finite Fields and Their Applications;2013-05