On error-correcting codes and invariant linear forms
SIAM Journal on Discrete Mathematics
The Subconstituent Algebra of an Association Scheme (Part III)
Journal of Algebraic Combinatorics: An International Journal
The Subconstituent Algebra of an Association Scheme (Part II)
Journal of Algebraic Combinatorics: An International Journal
The Subconstituent Algebra of an Association Scheme, (Part I)
Journal of Algebraic Combinatorics: An International Journal
The Terwilliger algebras of bipartite P- and Q-polynomial schemes
Discrete Mathematics
A New Proof of the Assmus–Mattson Theorem for Non-BinaryCodes
Designs, Codes and Cryptography
Designs in Product Association Schemes
Designs, Codes and Cryptography
On Harmonic Weight Enumerators of Binary Codes
Designs, Codes and Cryptography
Minimum Distance Bounds for s-Regular Codes
Designs, Codes and Cryptography
The Terwilliger algebra of the hypercube
European Journal of Combinatorics
A Criterion for Designs in {\tf="P101461" Z}_4-codes on the Symmetrized Weight Enumerator
Designs, Codes and Cryptography
Kernels and p-Kernels of pr-ary 1-Perfect Codes
Designs, Codes and Cryptography
New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
On binary linear codes supporting t-designs
IEEE Transactions on Information Theory
New code upper bounds from the Terwilliger algebra and semidefinite programming
IEEE Transactions on Information Theory
A strengthening of the Assmus-Mattson theorem
IEEE Transactions on Information Theory
A survey on spherical designs and algebraic combinatorics on spheres
European Journal of Combinatorics
Commutative association schemes
European Journal of Combinatorics
| Hi-index | 0.01 |
We use the Terwilliger algebra to provide a new approach to the Assmus-Mattson theorem. This approach also includes another proof of the minimum distance bound shown by W.J. Martin as well as its dual.