nets are point sets in Euclidian -space satisfying certain uniformity conditions, for use in numerical integration. They can equivalently be described in terms of ordered orthogonal arrays, a class of finite geometrical structures generalizing orthogonal arrays. This establishes a link between quasi-Monte Carlo methods and coding theory. We construct several new families of nets improving the known bounds on the size of nets. These constructions use coding-theoretic construction techniques, exploiting some of the nice properties of BCH-codes.
Back to the Index