A higher order Blokh-Zyablov propagation rule for higher order nets

DOI10.1016/J.FFA.2012.08.003zbMATH Open1272.11091arXiv1203.4322OpenAlexW1993511241MaRDI QIDQ690427FDOQ690427

Authors: Josef Dick, Peter Kritzer 

Publication date: 27 November 2012

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: Higher order nets were introduced by Dick as a generalisation of classical $(t,m,s)$-nets, which are point sets frequently used in quasi-Monte Carlo integration algorithms. Essential tools in finding such point sets of high quality are propagation rules, which make it possible to generate new higher order nets from existing higher order nets and even classical $(t,m,s)$-nets. Such propagation rules for higher order nets were first considered by the authors in [J. Dick, P. Kritzer. Duality theory and propagation rules for generalized digital nets. Math. Comp. 79, 993--1017, 2010] and further developed in [J. Baldeaux, J. Dick, F. Pillichshammer. Duality theory and propagation rules for higher order nets. Discrete Math. 311, 362--386, 2011]. In [E.L. Blokh, V.V. Zyablov. Coding of generalized concatenated codes. Problems of Information Transmission, 10, 218--222, 1974] Blokh and Zyablov established a very general propagation rule for linear codes. This propagation rule has been extended to $(t,m,s)$-nets by Sch"urer and Schmid in [R. Sch"{u}rer, W.Ch. Schmid. extit{MinT---the database of optimal net, code, OA, and OOA parameters}. Available at: exttt{http://mint.sbg.ac.at}]. In this paper we show that this propagation rule can also be extended to higher order nets. Examples indicate that this propagation rule yields new higher order nets with significantly higher quality.

Full work available at URL: https://arxiv.org/abs/1203.4322

Recommendations

• Duality theory and propagation rules for higher order nets
• A characterization of higher order nets using Weyl sums and its applications
• Duality theory and propagation rules for generalized digital nets
• Propagation rules for \((u, m, \mathbf{e}, s)\)-nets and \((u, \mathbf{e}, s)\)-sequences
• Constructions of digital nets

zbMATH Keywords

linear codesduality theoryhigher order netspropagation rules

Mathematics Subject Classification ID

Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Explicit Constructions of Quasi-Monte Carlo Rules for the Numerical Integration of High-Dimensional Periodic Functions
• Walsh Spaces Containing Smooth Functions and Quasi–Monte Carlo Rules of Arbitrary High Order
• Title not available (Why is that?)
• Title not available (Why is that?)
• MinT -- new features and new results
• Point sets and sequences with small discrepancy
• Duality theory and propagation rules for generalized digital nets
• Coding‐theoretic constructions for (t,m,s)‐nets and ordered orthogonal arrays
• On the existence of higher order polynomial lattices based on a generalized figure of merit
• Duality for digital nets and its applications
• Matrix-product constructions of digital nets
• A characterization of higher order nets using Weyl sums and its applications
• Equidistribution properties of generalized nets and sequences
• Duality theory and propagation rules for higher order nets
• Nets, (t, s)-Sequences, and Codes
• Title not available (Why is that?)

Cited In (1)

• Duality theory and propagation rules for higher order nets

Uses Software

• MinT

This page was built for publication: A higher order Blokh-Zyablov propagation rule for higher order nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690427)