arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1210.0776math.NAcs.NAmath.RA
收藏

关于有限阿贝尔群上数字网的重量枚举多项式与$t$值的快速计算

On the fast computation of the weight enumerator polynomial and the $t$ value of digital nets over finite abelian groups

University of New South Wales(新南威尔士大学);University of Tokyo(东京大学)

Josef Dick, Makoto Matsumoto

AI总结:

本文引入有限阿贝尔群上的数字网,证明其MacWilliams型恒等式,并基于此提出计算严格$t$值($\mathcal{O}(N s \log N)$)和重量枚举多项式($\mathcal{O}(N s (\log N)^2)$)的快速算法。

摘要:

本文引入了有限阿贝尔群上的数字网,它包含了有限域和某些环上的数字网作为特例。我们证明了这类数字网的MacWilliams型恒等式。该恒等式可用于计算有限阿贝尔群上数字网的严格$t$值。若数字网在$s$维单位立方体$[0,1]^s$中有$N$个点,则$t$值可在$\mathcal{O}(N s \log N)$次运算内计算,重量枚举多项式可在$\mathcal{O}(N s (\log N)^2)$次运算内计算,其中运算指整数算术运算。通过预计算某些值,计算重量枚举多项式的运算次数可进一步减少。

英文摘要:

In this paper we introduce digital nets over finite abelian groups which contain digital nets over finite fields and certain rings as a special case. We prove a MacWilliams type identity for such digital nets. This identity can be used to compute the strict $t$-value of a digital net over finite abelian groups. If the digital net has $N$ points in the $s$ dimensional unit cube $[0,1]^s$, then the $t$-value can be computed in $\mathcal{O}(N s \log N)$ operations and the weight enumerator polynomial can be computed in $\mathcal{O}(N s (\log N)^2)$ operations, where operations mean arithmetic of integers. By precomputing some values the number of operations of computing the weight enumerator polynomial can be reduced further.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑