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

DOI10.1016/j.ejc.2008.07.018zbMath1220.94052arXivmath/0612740OpenAlexW2055963617MaRDI QIDQ1011516

Hajime Tanaka

Publication date: 8 April 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0612740

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30)

Related Items

Design theory from the viewpoint of algebraic combinatorics ⋮ Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials ⋮ On relative \(t\)-designs in polynomial association schemes ⋮ On Lee association schemes over \(\mathbb{Z}_4\) and their Terwilliger algebra ⋮ Nonsymmetric Askey-Wilson polynomials and \(Q\)-polynomial distance-regular graphs ⋮ An Assmus-Mattson theorem for codes over commutative association schemes ⋮ A diagram associated with the subconstituent algebra of a distance-regular graph ⋮ Relative \(t\)-designs in nonbinary Hamming association schemes ⋮ Tight \(t\)-designs on one shell of Johnson association schemes ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ Commutative association schemes ⋮ On the shape of a tridiagonal pair

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The subconstituent algebra of an association scheme. I
• The subconstituent algebra of an association scheme. III
• The subconstituent algebra of an association scheme. II
• The Terwilliger algebra of the hypercube
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• 2-designs having an intersection number \(k-n\)
• Remarks on tactical configurations in codes
• Association schemes and t-designs in regular semilattices
• Spectra of bipartite \(P\)- and \(Q\)-polynomial association schemes
• The Terwilliger algebras of bipartite \(P\)- and \(Q\)-polynomial schemes
• Designs in product association schemes
• A criterion for designs in \({\mathbb Z}_4\)-codes on the symmetrized weight enumerator
• On harmonic weight enumerators of binary codes
• Mac Williams identities and coordinate partitions
• On the multiplicities of the primitive idempotents of a \(Q\)-polynomial distance-regular graph
• The displacement and split decompositions for a \(Q\)-polynomial distance-regular graph
• Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
• A strengthening of the Assmus-Mattson theorem
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Mixed block designs
• On binary linear codes supporting t-designs
• On Error-Correcting Codes and Invariant Linear Forms
• New 5-designs
• Minimum distance bounds for \(s\)-regular codes
• A new proof of the Assmus-Mattson theorem for non-binary codes