Designs from subcode supports of linear codes
Designs, Codes and Cryptography
Code enumerators and tutte polynomials
IEEE Transactions on Information Theory
European Journal of Combinatorics
Hi-index | 754.90 |
An efficient algorithm is presented for calculating higher weight enumerators of linear codes given generator matrices. By this algorithm, the higher weight enumerators of the unique doubly-even, self-dual code are calculated. The algorithm is based on a previously shown relationship between Tutte polynomials and higher weight enumerators.