New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra

European Journal of Combinatorics

Volumn 30, Issue 3, 2009, Pages 736-746

  Tanaka, Hajime ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 59149090481     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2008.07.018     Document Type: Article

References (30)

1. Assmus Jr. E.F., and Mattson Jr. H.F. New 5-designs. J. Combin. Theory 6 (1969) 122-151
2. Bachoc C. On harmonic weight enumerators of binary codes. Des. Codes Cryptogr. 18 (1999) 11-28
3. Bannai E., and Ito T. Algebraic Combinatorics I (1984), Benjamin/Cummings, Menlo Park
4. Beker H., and Haemers W. 2-designs having an intersection number k - n. J. Combin. Theory Ser. A 28 (1980) 64-81
5. Brouwer A.E., Cohen A.M., and Neumaier A. Distance-Regular Graphs (1989), Springer-Verlag, Berlin
6. Calderbank A.R., and Delsarte P. On error-correcting codes and invariant linear forms. SIAM J. Discrete Math. 6 (1993) 1-23
7. Calderbank A.R., Delsarte P., and Sloane N.J.A. A strengthening of the Assmus-Mattson theorem. IEEE Trans. Inform. Theory 37 (1991) 1261-1268
8. Caughman IV J.S. Spectra of bipartite P- and Q-polynomial association schemes. Graphs Combin. 14 (1998) 321-343
9. Caughman IV J.S. The Terwilliger algebras of bipartite P- and Q-polynomial schemes. Discrete Math. 196 (1999) 65-95
10. Delsarte P. An algebraic approach to the association schemes of coding theory. Philips Res. Rep. 10 Suppl. (1973)
11. Delsarte P. Association schemes and t-designs in regular semilattices. J. Combin. Theory Ser. A 20 (1976) 230-243
12. Delsarte P. Pairs of vectors in the space of an association scheme. Philips Res. Rep. 32 (1977) 373-411
13. Dumer I.I. Remarks on tactical configurations in codes. Math. Notes 28 (1980) 543-547
14. Gijswijt D., Schrijver A., and Tanaka H. New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming. J. Combin. Theory Ser. A 113 (2006) 1719-1731
15. Go J.T. The Terwilliger algebra of the hypercube. European J. Combin. 23 (2002) 399-429
16. Ito T., Tanabe K., and Terwilliger P. Some Algebra Related to P- and Q-Polynomial Association Schemes, Codes and Association Schemes (Piscataway, NJ, 1999) (2001), Amer. Math. Soc, Providence, RI. pp. 167-192 arXiv:math.CO/0406556
17. Lalaude-Labayle M. On binary linear codes supporting t-designs. IEEE Trans. Inform. Theory 47 (2001) 2249-2255
18. Martin W.J. Mixed block designs. J. Combin. Des. 6 (1998) 151-163
19. Martin W.J. Designs in product association schemes. Des. Codes Cryptogr. 16 (1999) 271-289
20. Martin W.J. Minimum distance bounds for s-regular codes. Des. Codes Cryptogr. 21 (2000) 181-187
21. Pascasio A.A. On the multiplicities of the primitive idempotents of a Q-polynomial distance-regular graph. European J. Combin. 23 (2002) 1073-1078
22. r-ary 1-perfect codes. Des. Codes Cryptogr. 37 (2005) 243-261
23. Schrijver A. New code upper bounds from the Terwilliger algebra and semidefinite programming. IEEE Trans. Inform. Theory 51 (2005) 2859-2866
24. Simonis J. MacWilliams identities and coordinate partitions. Linear Algebra Appl. 216 (1995) 81-91
25. Tanabe K. A new proof of the Assmus-Mattson theorem for non-binary codes. Des. Codes Cryptogr. 22 (2001) 149-155
26. 4-codes on the symmetrized weight enumerator. Des. Codes Cryptogr. 30 (2003) 169-185
27. Terwilliger P. The subconstituent algebra of an association scheme I. J. Algebraic Combin. 1 (1992) 363-388
28. Terwilliger P. The subconstituent algebra of an association scheme II. J. Algebraic Combin. 2 (1993) 73-103
29. Terwilliger P. The subconstituent algebra of an association scheme III. J. Algebraic Combin. 2 (1993) 177-210
30. Terwilliger P. The displacement and split decompositions for a Q-polynomial distance-regular graph. Graphs Combin. 21 (2005) 263-276. arXiv:math.CO/0306142