Fourier-reflexive partitions and MacWilliams identities for additive codes

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of this dualization are investigated, and a convenient test is given for when the bidual partition coincides with 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.

Original languageEnglish
Pages (from-to)543-563
Number of pages21
JournalDesigns, Codes, and Cryptography
Issue number3
StatePublished - Jun 1 2015

Bibliographical note

Funding Information:
The author was partially supported by the National Science Foundation grants #DMS-0908379 and #DMS-1210061. I would like to thank Marcus Greferath and Navin Kashyap for very inspiring suggestions concerning this research project. A major part of the final write-up took place during a research stay at the University of Zürich, and I am grateful to Joachim Rosenthal and his research group for the generous hospitality. I also would like to thank the anonymous reviewers for very helpful suggestions, in particular with respect to the proof of Theorem 3.3(b).

Publisher Copyright:
© 2014, Springer Science+Business Media New York.


  • Dualization
  • Partitions
  • Poset structures
  • Weight enumerators

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Fourier-reflexive partitions and MacWilliams identities for additive codes'. Together they form a unique fingerprint.

Cite this