Gleason's theorem on self-dual codes
From MaRDI portal
Publication:5650272
DOI10.1109/TIT.1972.1054817zbMath0239.94005OpenAlexW2027499675MaRDI QIDQ5650272
F. J. MacWilliams, Elwyn R. Berlekamp, N. J. A. Sloane
Publication date: 1972
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1972.1054817
Related Items
Invariants of finite groups and their applications to combinatorics, The application of invariant theory to the existence of quasi-symmetric designs, Weight enumerators, intersection enumerators, and Jacobi polynomials, A formula on the weight distribution of linear codes with applications to AMDS codes, Unnamed Item, Algebraic theory of block codes detecting independent errors, Weight enumerators, intersection enumerators and Jacobi polynomials. II, New self-dual codes from \(2 \times 2\) block circulant matrices, group rings and neighbours of neighbours, Jacobi polynomials and design theory. II, The weight enumerators of singly-even self-dual \([88,44,14\) codes and new binary self-dual \([68,34,12]\) and \([88,44,14]\) codes], Jacobi polynomials and design theory I, Self-dual codes over the integers modulo 4, On the classification and enumeration of self-dual codes, Weight enumerators of self-orthogonal codes, Upper bounds for modular forms, lattices, and codes, A survey of constructive coding theory, and a table of binary codes of highest known rate, Weight Enumerators of Normalized Codes
