A construction of digital \((0,s)\)-sequences involving finite-row generator matrices (Q413562)

From MaRDI portal
Revision as of 00:12, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A construction of digital \((0,s)\)-sequences involving finite-row generator matrices
scientific article

    Statements

    A construction of digital \((0,s)\)-sequences involving finite-row generator matrices (English)
    0 references
    0 references
    7 May 2012
    0 references
    One of the most powerful methods of constructing low-discrepancy sequences is the theory of \((t,m,s)\)-nets and \((t,s)\)-sequences by Niederreiter and the proper digital construction methods (that generalize widely the classical Van-der-Corput sequence). The purpose to the present paper is to provide a generalization of an explicit construction method for digital \((0,s)\)-sequences over \(\mathbb{F}_q\). A special feature of this construction method is the so-called finite row property (for those matrices that are used in the the digital construction method. Previously, explicit examples of finite-row digital \((0,s)\)-sequences have been only known for finite prime fields. An important ingredient of the constructions is a hyperderivative of polynomials over \(\mathbb{F}_q\).
    0 references
    digital \((0,s)\)-sequences
    0 references
    finite-row generator matrices
    0 references
    low-discrepancy sequences
    0 references
    finite fields
    0 references

    Identifiers