An Assmus-Mattson theorem for codes over commutative association schemes
From MaRDI portal
Publication:1744016
DOI10.1007/s10623-017-0376-yzbMath1384.05184arXiv1610.07334OpenAlexW3105263361MaRDI QIDQ1744016
Hajime Tanaka, John Vincent S. Morales
Publication date: 16 April 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.07334
Terwilliger algebradesignassociation schemeAssmus-Mattson theoremcodemultivariable polynomial interpolation
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30)
Related Items (2)
Weighted subspace designs from \(q\)-polymatroids ⋮ An Assmus--Mattson Theorem for Rank Metric Codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An upper bound of the value of \(t\) of the support \(t\)-designs of extremal binary doubly even self-dual codes
- On Lee association schemes over \(\mathbb{Z}_4\) and their Terwilliger algebra
- 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 least solution for the polynomial interpolation problem
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- On relative \(t\)-designs in polynomial association schemes
- New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
- Commutative association schemes
- Extremal double circulant type II codes over \(\mathbb Z_4\) and construction of 5-(24,10,36) designs.
- A criterion for designs in \({\mathbb Z}_4\)-codes on the symmetrized weight enumerator
- Designs in additive codes over GF(4)
- Self-dual codes over the Kleinian four group
- An Assmus-Mattson-type approach for identifying 3-designs from linear codes over \(\mathbb{Z}_4\)
- 3-colored 5-designs and \(\mathbb{Z}_4\)-codes
- On harmonic weight enumerators of binary codes
- Mac Williams identities and coordinate partitions
- Polynomial interpolation in several variables
- 3-designs from all \(\mathbb Z_{4}\)-Goethals-like codes with block size 7 and 8
- The displacement and split decompositions for a \(Q\)-polynomial distance-regular graph
- On multivariate polynomial interpolation
- The Rahman polynomials and the Lie algebra $\mathfrak{sl}_{3}(\mathbb{C})$
- A Lie-theoretic interpretation of multivariate hypergeometric polynomials
- A strengthening of the Assmus-Mattson theorem
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New 5-designs constructed from the lifted Golay code over ?4
- An Assmus-Mattson theorem for Z/sub 4/-codes
- Association schemes and coding theory
- (𝑛+1,𝑚+1)-hypergeometric functions associated to character algebras
- On Error-Correcting Codes and Invariant Linear Forms
- New 5-designs
- A new proof of the Assmus-Mattson theorem for non-binary codes
- On \(t\)-designs from codes over \(\mathbb{Z}_4\)
This page was built for publication: An Assmus-Mattson theorem for codes over commutative association schemes