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

preprint2012arXivOpen access

Abstract

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 tt-value of a digital net over finite abelian groups. If the digital net has NN points in the ss dimensional unit cube [0,1]s[0,1]^s, then the tt-value can be computed in O(Nslog⁡N)\mathcal{O}(N s \log N) operations and the weight enumerator polynomial can be computed in O(Ns(log⁡N)2)\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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.