In this paper various methods for computing the support weight enumerators of binary, linear, even, isodual codes are described. It is shown that there exist relationships between support weight enumerators and coset weight distributions of a code that can be used to compute partial information about one set of these code invariants from the other. The support weight enumerators and complete coset weight distributions of several even, isodual codes of length up to 22 are computed as well. It is observed that there exist inequivalent codes with the same support weight enumerators, inequivalent codes with the same complete coset weight distribution and inequivalent codes with the same support eight enumerators and complete coset weight distribution.
Keywords coset weight distribution - formally self-dual codes - support weight enumerators
Communicated by:T. Helleseth
AMS Classification: 11T71, 68P30
Parts of the results in this paper were presented at the 2001 International Symposium on Information Theory, Washington, and at the 2002 International Symposium on Information Theory, Lauzanne.