2000 character limit reached
Fourier-Reflexive Partitions and MacWilliams Identities for Additive Codes (1304.1207v1)
Published 3 Apr 2013 in cs.IT, math.CO, and math.IT
Abstract: A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of the dual partitions are investigated and a convenient test is given for the case that the bidual partition coincides the primal partition. Such partitions permit MacWilliams identities for the partition enumerators of additive codes. It is shown that dualization commutes with taking products and symmetrized products of partitions on cartesian powers of the given group. After translating the results to Frobenius rings, which are identified with their character module, the approach is applied to partitions that arise from poset structures.