A Complete Classification of Digital (0,m, 3)-Nets and Digital (0, 2)-Sequences in Base 2

Uniform distribution theory Pub Date : 2019-06-01 DOI:10.2478/udt-2019-0004

Roswitha Hofer, Kosuke Suzuki

引用次数: 1

Abstract

Abstract We give a complete classification of all matrices C1,C2,C3 ∈ C3∈𝔽 2m×m {C_3} \in \mathbb{F}_2^{m \times m} which generate a digital (0,m, 3)-net in base 2 and a complete classification of all matrices C1,C2 ∈ C2∈𝔽 2ℕ×ℕ {C_2} \in \mathbb{F}_2^{\mathbb{N} \times \mathbb{N}} which generate a digital (0, 2)-sequence in base 2.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

基数2中数字(0,m, 3)-网和数字(0,2)-序列的完全分类

摘要给出了在\mathbb{F}_2^{m \乘以m}中生成基数为2的数字(0,m, 3)序列的所有矩阵C1,C2,C3∈C3∈ 2m×m {C_3} \的完全分类，以及在\mathbb{F}_2^{\mathbb{N} \乘以\mathbb{N}}中生成基数为2的数字(0,m, 3)序列的所有矩阵C1,C2∈C2∈λ 2∈∈∈mathbb{C_2} \的完全分类。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Uniform distribution theory

自引率

0.00%

发文量

期刊最新文献

Random Polynomials in Legendre Symbol Sequences On the Expected ℒ2–Discrepancy of Jittered Sampling Equidistribution of Continuous Functions Along Monotone Compact Covers Refinement of the Theorem of Vahlen On a Reduced Component-by-Component Digit-by-Digit Construction of Lattice Point Sets