On self-dual, doubly even codes of length 32
Journal of Combinatorial Theory Series A
Support weight distribution of linear codes
Discrete Mathematics - A collection of contributions in honour of Jack van Lint
Discrete Mathematics - A collection of contributions in honour of Jack van Lint
Classification of Extremal Double Circulant Formally Self-DualEven Codes
Designs, Codes and Cryptography
Trellis Structure and Higher Weights of Extremal Self-Dual Codes
Designs, Codes and Cryptography
On Harmonic Weight Enumerators of Binary Codes
Designs, Codes and Cryptography
On the Classification of Extremal Even Formally Self-DualCodes
Designs, Codes and Cryptography
Geometric approach to higher weights
IEEE Transactions on Information Theory - Part 1
IEEE Transactions on Information Theory
Generalized Hamming weights of BCH(3) revisited
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Parity, eulerian subgraphs and the Tutte polynomial
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
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.