{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:12:36Z","timestamp":1758823956142,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T00:00:00Z","timestamp":1498176000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Japan Society for the Promotion of Science (JP)","award":["KAKENHI Grant No. 25400034"],"award-info":[{"award-number":["KAKENHI Grant No. 25400034"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10623-017-0376-y","type":"journal-article","created":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T02:07:46Z","timestamp":1498183666000},"page":"1039-1062","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Assmus\u2013Mattson theorem for codes over commutative association schemes"],"prefix":"10.1007","volume":"86","author":[{"given":"John Vincent S.","family":"Morales","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5958-0375","authenticated-orcid":false,"given":"Hajime","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,23]]},"reference":[{"key":"376_CR1","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","volume":"6","author":"EF Assmus Jr","year":"1969","unstructured":"Assmus Jr. E.F., Mattson Jr. H.F.: New $$5$$ 5 -designs. J. Comb. Theory 6, 122\u2013151 (1969).","journal-title":"J. Comb. Theory"},{"key":"376_CR2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1023\/A:1008368615935","volume":"18","author":"C Bachoc","year":"1999","unstructured":"Bachoc C.: On harmonic weight enumerators of binary codes. Des. Codes Cryptogr. 18, 11\u201328 (1999).","journal-title":"Des. Codes Cryptogr."},{"unstructured":"Bannai E., Bannai E., Suda S., Tanaka H.: On relative $$t$$ t -designs in polynomial association schemes. Electron. J. Comb. 22, #P4.47 (2015). arXiv:1303.7163 .","key":"376_CR3"},{"key":"376_CR4","volume-title":"Algebraic Combinatorics I: Association Schemes","author":"E Bannai","year":"1984","unstructured":"Bannai E., Ito T.: Algebraic Combinatorics I: Association Schemes. Benjamin\/Cummings, Menlo Park (1984)."},{"key":"376_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.17323\/1609-4514-2006-6-2-225-264","volume":"6","author":"E Bannai","year":"2006","unstructured":"Bannai E., Koike M., Shinohara M., Tagami M.: Spherical designs attached to extremal lattices and the modulo $$p$$ p property of Fourier coefficients of extremal modular forms. Mosc. Math. J. 6, 225\u2013264 (2006).","journal-title":"Mosc. Math. J."},{"key":"376_CR6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0378-3758(99)00117-2","volume":"86","author":"A Bonnecaze","year":"2000","unstructured":"Bonnecaze A., Rains E., Sol\u00e9 P.: $$3$$ 3 -Colored $$5$$ 5 -designs and $$\\mathbf{Z}_4$$ Z 4 -codes. J. Stat. Plan. Inference 86, 349\u2013368 (2000).","journal-title":"J. Stat. Plan. Inference"},{"key":"376_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"AE Brouwer","year":"1989","unstructured":"Brouwer A.E., Cohen A.M., Neumaier A.: Distance-Regular Graphs. Springer, Berlin (1989)."},{"key":"376_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0406001","volume":"6","author":"AR Calderbank","year":"1993","unstructured":"Calderbank A.R., Delsarte P.: On error-correcting codes and invariant linear forms. SIAM J. Discret. Math. 6, 1\u201323 (1993).","journal-title":"SIAM J. Discret. Math."},{"key":"376_CR9","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1109\/18.133244","volume":"37","author":"AR Calderbank","year":"1991","unstructured":"Calderbank A.R., Delsarte P., Sloane N.J.A.: A strengthening of the Assmus-Mattson theorem. IEEE Trans. Inf. Theory 37, 1261\u20131268 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"376_CR10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF01890412","volume":"6","author":"C Boor de","year":"1990","unstructured":"de Boor C., Ron A.: On multivariate polynomial interpolation. Constr. Approx. 6, 287\u2013302 (1990).","journal-title":"Constr. Approx."},{"key":"376_CR11","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF02571803","volume":"210","author":"C Boor de","year":"1992","unstructured":"de Boor C., Ron A.: The least solution for the polynomial interpolation problem. Math. Z. 210, 347\u2013378 (1992).","journal-title":"Math. Z."},{"key":"376_CR12","first-page":"1","volume":"10","author":"P Delsarte","year":"1973","unstructured":"Delsarte P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 10, 1\u201397 (1973).","journal-title":"Philips Res. Rep. Suppl."},{"key":"376_CR13","doi-asserted-by":"crossref","first-page":"2477","DOI":"10.1109\/18.720545","volume":"44","author":"P Delsarte","year":"1998","unstructured":"Delsarte P., Levenshtein V.I.: Association schemes and coding theory. IEEE Trans. Inf. Theory 44, 2477\u20132504 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"376_CR14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1023\/A:1018981505752","volume":"12","author":"M Gasca","year":"2000","unstructured":"Gasca M., Sauer T.: Polynomial interpolation in several variables. Adv. Comput. Math. 12, 377\u2013410 (2000).","journal-title":"Adv. Comput. Math."},{"key":"376_CR15","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1016\/j.jcta.2006.03.010","volume":"113","author":"D Gijswijt","year":"2006","unstructured":"Gijswijt D., Schrijver A., Tanaka H.: New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming. J. Comb. Theory A 113, 1719\u20131731 (2006).","journal-title":"J. Comb. Theory A"},{"unstructured":"Godsil C.D.: Generalized Hamming schemes, manuscript (2010). arXiv:1011.1044 .","key":"376_CR16"},{"key":"376_CR17","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0012-365X(98)00035-1","volume":"194","author":"TA Gulliver","year":"1999","unstructured":"Gulliver T.A., Harada M.: Extremal double circulant type II codes over $$\\mathbb{Z}_4$$ Z 4 and construction of $$5$$ 5 - $$(24,10,36)$$ ( 24 , 10 , 36 ) designs. Discret. Math. 194, 129\u2013137 (1999).","journal-title":"Discret. Math."},{"key":"376_CR18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/(SICI)1520-6610(1998)6:3<225::AID-JCD4>3.0.CO;2-H","volume":"6","author":"M Harada","year":"1998","unstructured":"Harada M.: New $$5$$ 5 -designs constructed from the lifted Golay code over $$\\mathbb{Z}_4$$ Z 4 . J. Comb. Des. 6, 225\u2013229 (1998).","journal-title":"J. Comb. Des."},{"key":"376_CR19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0012-365X(00)00417-9","volume":"238","author":"T Helleseth","year":"2001","unstructured":"Helleseth T., Rong C., Yang K.: On $$t$$ t -designs from codes over $$\\mathbf{Z}_4$$ Z 4 . Discret. Math. 238, 67\u201380 (2001).","journal-title":"Discret. Math."},{"key":"376_CR20","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s00208-003-0440-y","volume":"327","author":"G H\u00f6hn","year":"2003","unstructured":"H\u00f6hn G.: Self-dual codes over the Kleinian four group. Math. Ann. 327, 227\u2013255 (2003). arXiv:math\/0005266 .","journal-title":"Math. Ann."},{"key":"376_CR21","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1112\/S0010437X11007421","volume":"148","author":"P Iliev","year":"2012","unstructured":"Iliev P.: A Lie-theoretic interpretation of multivariate hypergeometric polynomials. Compos. Math. 148, 991\u20131002 (2012). arXiv:1101.1683 .","journal-title":"Compos. Math."},{"key":"376_CR22","doi-asserted-by":"crossref","first-page":"4225","DOI":"10.1090\/S0002-9947-2012-05495-X","volume":"364","author":"P Iliev","year":"2012","unstructured":"Iliev P., Terwilliger P.: The Rahman polynomials and the Lie algebra $$\\mathfrak{sl}_3(\\mathbb{C})$$ sl 3 ( C ) . Trans. Am. Math. Soc. 364, 4225\u20134238 (2012). arXiv:1006.5062 .","journal-title":"Trans. Am. Math. Soc."},{"key":"376_CR23","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1023\/A:1025484821641","volume":"30","author":"J-L Kim","year":"2003","unstructured":"Kim J.-L., Pless V.: Designs in additive codes over $$GF(4)$$ G F ( 4 ) . Des. Codes Cryptogr. 30, 187\u2013199 (2003).","journal-title":"Des. Codes Cryptogr."},{"key":"376_CR24","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1016\/j.ffa.2006.02.001","volume":"13","author":"J Lahtonen","year":"2007","unstructured":"Lahtonen J., Ranto K., Vehkalahti R.: $$3$$ 3 -designs from all $$\\mathbf{Z}_4$$ Z 4 -Goethals-like codes with block size $$7$$ 7 and $$8$$ 8 . Finite Fields Appl. 13, 815\u2013827 (2007).","journal-title":"Finite Fields Appl."},{"key":"376_CR25","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1016\/j.ejc.2008.11.001","volume":"30","author":"WJ Martin","year":"2009","unstructured":"Martin W.J., Tanaka H.: Commutative association schemes. Eur. J. Comb. 30, 1497\u20131525 (2009). arXiv:0811.2475 .","journal-title":"Eur. J. Comb."},{"key":"376_CR26","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10623-014-0033-7","volume":"79","author":"T Miezaki","year":"2016","unstructured":"Miezaki T., Nakasora H.: An upper bound of the value of $$t$$ t of the support $$t$$ t -designs of extremal binary doubly even self-dual codes. Des. Codes Cryptogr. 79, 37\u201346 (2016). arXiv:1311.2122 .","journal-title":"Des. Codes Cryptogr."},{"key":"376_CR27","doi-asserted-by":"crossref","first-page":"2613","DOI":"10.1090\/S0002-9939-04-07399-X","volume":"132","author":"H Mizukawa","year":"2004","unstructured":"Mizukawa H., Tanaka H.: $$(n+1, m+1)$$ ( n + 1 , m + 1 ) -Hypergeometric functions associated to character algebras. Proc. Am. Math. Soc. 132, 2613\u20132618 (2004).","journal-title":"Proc. Am. Math. Soc."},{"key":"376_CR28","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.laa.2016.08.033","volume":"510","author":"JVS Morales","year":"2016","unstructured":"Morales J.V.S.: On Lee association schemes over $$\\mathbb{Z}_4$$ Z 4 and their Terwilliger algebra. Linear Algebra Appl. 510, 311\u2013328 (2016).","journal-title":"Linear Algebra Appl."},{"key":"376_CR29","doi-asserted-by":"crossref","first-page":"2859","DOI":"10.1109\/TIT.2005.851748","volume":"51","author":"A Schrijver","year":"2005","unstructured":"Schrijver A.: New code upper bounds from the Terwilliger algebra and semidefinite programming. IEEE Trans. Inf. Theory 51, 2859\u20132866 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"376_CR30","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1023\/A:1027338603957","volume":"31","author":"D-J Shin","year":"2004","unstructured":"Shin D.-J., Kumar P.V., Helleseth T.: An Assmus-Mattson-type approach for identifying $$3$$ 3 -designs from linear codes over $$\\mathbf{Z}_4$$ Z 4 . Des. Codes Cryptogr. 31, 75\u201392 (2004).","journal-title":"Des. Codes Cryptogr."},{"key":"376_CR31","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0024-3795(93)00106-A","volume":"216","author":"J Simonis","year":"1995","unstructured":"Simonis J.: MacWilliams identities and coordinate partitions. Linear Algebra Appl. 216, 81\u201391 (1995).","journal-title":"Linear Algebra Appl."},{"key":"376_CR32","first-page":"45","volume-title":"Coding Theory and Applications. Lecture Notes in Computer Science","author":"P Sol\u00e9","year":"1988","unstructured":"Sol\u00e9 P.: The Lee association scheme. In: Cohen G., Godlewski P. (eds.) Coding Theory and Applications. Lecture Notes in Computer Science, vol. 311, pp. 45\u201355. Springer, Berlin (1988)."},{"key":"376_CR33","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/B978-0-7204-2262-7.50040-5","volume-title":"A Survey of Combinatorial Theory","author":"JN Srivastava","year":"1973","unstructured":"Srivastava J.N., Chopra D.V.: Balanced arrays and orthogonal arrays. In: Srivastava J.N. (ed.) A Survey of Combinatorial Theory, pp. 411\u2013428. North-Holland, Amsterdam (1973)."},{"key":"376_CR34","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/18.817507","volume":"46","author":"K Tanabe","year":"2000","unstructured":"Tanabe K.: An Assmus-Mattson theorem for $$\\mathbf{Z}_4$$ Z 4 -codes. IEEE Trans. Inf. Theory 46, 48\u201353 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"376_CR35","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1008308820821","volume":"22","author":"K Tanabe","year":"2001","unstructured":"Tanabe K.: A new proof of the Assmus-Mattson theorem for non-binary codes. Des. Codes Cryptogr. 22, 149\u2013155 (2001).","journal-title":"Des. Codes Cryptogr."},{"key":"376_CR36","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1023\/A:1025432804803","volume":"30","author":"K Tanabe","year":"2003","unstructured":"Tanabe K.: A criterion for designs in $$\\mathbb{Z}_4$$ Z 4 -codes on the symmetrized weight enumerator. Des. Codes Cryptogr. 30, 169\u2013185 (2003).","journal-title":"Des. Codes Cryptogr."},{"key":"376_CR37","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1016\/j.ejc.2008.07.018","volume":"30","author":"H Tanaka","year":"2009","unstructured":"Tanaka H.: New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra. Eur. J. Comb. 30, 736\u2013746 (2009). arXiv:math\/0612740 .","journal-title":"Eur. J. Comb."},{"unstructured":"Tanaka H., Tanaka R., Watanabe Y.: The Terwilliger algebra of a $$Q$$ Q -polynomial distance-regular graph with respect to a set of vertices (in preparation).","key":"376_CR38"},{"key":"376_CR39","first-page":"128","volume-title":"The Very Knowledge of Coding","author":"H Tarnanen","year":"1987","unstructured":"Tarnanen H.: On extensions of association schemes. In: Laakso H., Salomaa A. (eds.) The Very Knowledge of Coding, pp. 128\u2013142. University of Turku, Institute for Applied Mathematics, Turku (1987)."},{"key":"376_CR40","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/A:1022494701663","volume":"1","author":"P Terwilliger","year":"1992","unstructured":"Terwilliger P.: The subconstituent algebra of an association scheme I. J. Algebr. Comb. 1, 363\u2013388 (1992).","journal-title":"J. Algebr. Comb."},{"key":"376_CR41","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/A:1022480715311","volume":"2","author":"P Terwilliger","year":"1993","unstructured":"Terwilliger P.: The subconstituent algebra of an association scheme II. J. Algebr. Comb. 2, 73\u2013103 (1993).","journal-title":"J. Algebr. Comb."},{"key":"376_CR42","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1023\/A:1022415825656","volume":"2","author":"P Terwilliger","year":"1993","unstructured":"Terwilliger P.: The subconstituent algebra of an association scheme III. J. Algebr. Comb. 2, 177\u2013210 (1993).","journal-title":"J. Algebr. Comb."},{"doi-asserted-by":"crossref","unstructured":"Terwilliger P.: The displacement and split decompositions for a $$Q$$ Q -polynomial distance-regular graph. Graphs Comb. 21, 263\u2013276 (2005). arXiv:math.CO\/0306142 .","key":"376_CR43","DOI":"10.1007\/s00373-004-0594-8"},{"unstructured":"Terwilliger P.: Six Lectures on Distance-regular Graphs. Lecture Notes. De La Salle University, Metro Manila. http:\/\/www.math.wisc.edu\/~terwilli\/teaching.html (2010).","key":"376_CR44"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-017-0376-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0376-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0376-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T13:31:39Z","timestamp":1569504699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-017-0376-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,23]]},"references-count":44,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["376"],"URL":"https:\/\/doi.org\/10.1007\/s10623-017-0376-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2017,6,23]]}}}