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

DOI10.1016/0012-365X(92)90566-XzbMath0918.11045MaRDI QIDQ1199626

Harald Niederreiter

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

uniform distributionorthogonal arraysminimum distance(t,m,s)-netslinear code over finite field

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Irregularities of distribution, discrepancy (11K38)

Related Items (21)

\(d\)-dimensional hypercubes and the Euler and MacNeish conjectures ⋮ On the numerical integration of high-dimensional Walsh-series by quasi-Monte Carlo methods ⋮ Weight distribution of the crown-weight space ⋮ Codes with a poset metric ⋮ Digital nets and sequences constructed over finite rings and their application to quasi-Monte Carlo integration ⋮ Combinatorial methods in the construction of point sets with uniformity properties ⋮ Quasi-Monte Carlo methods for the numerical integration of multivariate Walsh series ⋮ Niederreiter-Rosenbloom-Tsfasman LCD codes ⋮ Wei-type duality theorems for matroids ⋮ Good Parameters for a Class of Node Sets in Quasi-Monte Carlo Integration ⋮ The poset structures admitting the extended binary Golay code to be a perfect code ⋮ New explicit bounds for ordered codes and \((t,m,s)\)-nets ⋮ Cubic and higher degree bounds for codes and \((t,m,s)\)-nets ⋮ The poset structures admitting the extended binary Hamming code to be a perfect code ⋮ Representation of Functions as Walsh Series to Different Bases and an Application to the Numerical Integration of High-Dimensional Walsh Series ⋮ Maximum distance separable poset codes ⋮ Constructions of nets via OAs of strength 3 with a prescribed property ⋮ On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure ⋮ Orthogonal hypercubes and related designs ⋮ Automorphism group of the crown-weight space ⋮ Factorization of polynomials and some linear-algebra problems over finite fields

Cites Work

• Point sets and sequences with small discrepancy
• Low-discrepancy and low-dispersion sequences
• A combinatorial problem for vector spaces over finite fields
• Point sets with uniformity properties and orthogonal hypercubes
• Low-discrepancy point sets obtained by digital constructions over finite fields
• Quasi-Monte Carlo methods and pseudo-random numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes