MacWilliams identities play a prominent role in algebraic coding theory because they tell how certain information about a code, encoded in enumerators,  can be used to deduce information about the dual code. We will provide a unified approach to MacWilliams identities for various weight enumerators of linear block codes over Frobenius rings.  Such enumerators count the number of codewords having a pre-specified property, and MacWilliams identities yield a transformation between such an enumerator and the corresponding enumerator of the dual code. All identities can be derived from a MacWilliams identity for the full weight enumerator using the concept of an F-partition, as introduced by Zinoviev and Ericson (1996).



The talk will be self-contained, and only basic knowledge of linear algebra and introductory ring theory will be required.