Trellis Structure and Higher Weights of Extremal Self-Dual Codes

A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and corresponding permutations are known for relatively few codes.The task of finding such permutations is shown to be substantially simplifiable in the case of self-dual codes in general, and for self-dual codes of sufficiently high minimum distance it is shown that it is frequently possible to deduce the existence of these permutations directly from the parameters of the code.A new and tighter link between generalized Hamming weights and trellis representations is demonstrated: for some self-dual codes, knowledge of one of the generalized Hamming weights is sufficient to determine the entire optimal state complexity profile.These results are used to characterize the permutation-optimal trellises and generalized Hamming weights for all 32,16,8] binary self-dual codes and for several other codes. The numbers of uniformly efficient permutations for several codes, including the 24,12,8] Golay code and both 24,12,9] ternary self-dual codes, are found.