7 research outputs found
On the fast computation of the weight enumerator polynomial and the value of digital nets over finite abelian groups
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 -value of a digital net over finite abelian
groups. If the digital net has points in the dimensional unit cube
, then the -value can be computed in
operations and the weight enumerator polynomial can be computed in
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