{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:44Z","timestamp":1754161604322,"version":"3.41.2"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1023\/a:1008327726247","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"215-234","source":"Crossref","is-referenced-by-count":12,"title":["Jacobi Polynomials, Type II Codes, and Designs"],"prefix":"10.1007","volume":"16","author":[{"given":"Alexis","family":"Bonnecaze","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Sol\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"199815_CR1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/TIT.1983.1056681","volume":"IT-29","author":"E.F. Assmus Jr.","year":"1983","unstructured":"E.F. Assmus, Jr., V. Pless, On the covering radius of extremal self-dual codes, IEEE Trans. on Information Theory, Vol. IT-29 (1983) pp. 359-363.","journal-title":"IEEE Trans. on Information Theory"},{"issue":"1","key":"199815_CR2","first-page":"12","volume":"72","author":"E. Bannai","year":"1996","unstructured":"E. Bannai, M. Ozeki, Construction of Jacobi forms from certain combinatorial polynomials, Proceedings of the Japan Academy, Vol. 72, Ser. A, No. 1, (1996) pp. 12-15.","journal-title":"Proceedings of the Japan Academy"},{"key":"199815_CR3","first-page":"1","volume":"11","author":"W. Bosma","year":"1997","unstructured":"W. Bosma, J. Cannon, C. Playoust, The Magma algebra system I: The user language, Jounal of Symbolic Computation, Vol. 11 (1997) pp. 1-31.","journal-title":"Jounal of Symbolic Computation"},{"issue":"1","key":"199815_CR4","first-page":"113","volume":"2","author":"J. Cannon","year":"1996","unstructured":"J. Cannon, C. Playoust, Magma: A new computer algebra system, Euromath Bulletin, Vol.2,No. 1, (1996) pp. 113-144.","journal-title":"Euromath Bulletin"},{"key":"199815_CR5","volume-title":"Distance-Regular Graphs","author":"A.E. Brouwer","year":"1985","unstructured":"A.E. Brouwer, A. M. Cohen, A. Neumaier, Distance-Regular Graphs. Springer-Verlag, Berlin, Heidelberg (1985)."},{"key":"199815_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0406001","volume":"6","author":"A.R. Calderbank","year":"1993","unstructured":"A.R. Calderbank, P. Delsarte, On error-correcting codes and invariant linear forms. SIAM J. of Discr. Math., Vol. 6 (1993) pp. 1-23.","journal-title":"SIAM J. of Discr. Math."},{"key":"199815_CR7","first-page":"941","volume":"338","author":"A.R. Calderbank","year":"1993","unstructured":"A.R. Calderbank, P. Delsarte, Extending the t-design concept. Trans. of The AMS Vol. 338 (1993) pp. 941-952.","journal-title":"Trans. of The AMS"},{"key":"199815_CR8","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1109\/18.133244","volume":"IT-37","author":"A.R. Calderbank","year":"1991","unstructured":"A.R. Calderbank, P. Delsarte, N.J.A. Sloane, A strengthening of the Assmus-Mattson theorem, IEEE Trans. on Information Theory, Vol. IT-37 (1991) pp. 1261-1268.","journal-title":"IEEE Trans. on Information Theory"},{"key":"199815_CR9","doi-asserted-by":"crossref","unstructured":"P. Camion, B. Courteau, A. Monpetit, Cosets weight enumerators of the extremal self-dual binary codes of length 32, Proceedings of Eurocode 92, CISM Lect. No. 339, Springer (1993) pp. 17-29.","DOI":"10.1007\/978-3-7091-2786-5_2"},{"key":"199815_CR10","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","volume":"IT-31","author":"G.D. Cohen","year":"1985","unstructured":"G.D. Cohen, M. Karpovsky, H.F. Mattson, Jr.r., J.R. Schatz, Covering radius-survey and recent results, IEEE Trans. on Information Theory, Vol. IT-31, (1985) pp. 328-343.","journal-title":"IEEE Trans. on Information Theory"},{"key":"199815_CR11","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/0097-3165(80)90057-6","volume":"28","author":"J.H. Conway","year":"1980","unstructured":"J.H. Conway, V. Pless, On the enumeration of self-dual codes, J. Comb. Theory Ser. A, Vol. 28 (1980) pp. 26-53.","journal-title":"J. Comb. Theory Ser. A"},{"key":"199815_CR12","unstructured":"S.T. Dougherty, M. Harada, New Extremal Self-dual codes of Length 68, preprint (1996)."},{"key":"199815_CR13","unstructured":"J.H. Dinitz, D.R. Stinson, Contemporary Design Theory: a collection of surveys, Wiley (1992)."},{"key":"199815_CR14","doi-asserted-by":"crossref","unstructured":"M. Eichler, D. Zagier, The Theory of Jacobi Forms, Birkh\u00e4user (1985).","DOI":"10.1007\/978-1-4684-9162-3"},{"key":"199815_CR15","unstructured":"A. Gleason, Weight polynomials of self-dual codes and the MacWilliams identities, in: Actes Congr\u00e8s International de Math\u00e9matiques Nice 1970, Vol. 3, Gauthiers-Villars (1971) pp. 211-215."},{"key":"199815_CR16","doi-asserted-by":"crossref","unstructured":"D.M. Gordon, G. Kuperberg, O. Patashnik, New constructions for covering designs, preprint (1995). http:\/\/sdcc12.ucsd.edu\/ xm3dg\/cover.html","DOI":"10.1002\/jcd.3180030404"},{"key":"199815_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0012-365X(94)00010-G","volume":"142","author":"G.T. Kennedy","year":"1995","unstructured":"G.T. Kennedy, V. Pless, A coding theoretic approach to extending designs, Discrete Math. Vol. 142 (1995) 155-168.","journal-title":"Discrete Math."},{"key":"199815_CR18","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/S0019-9958(73)90273-8","volume":"22","author":"C.L. Mallows","year":"1973","unstructured":"C.L. Mallows, N.J.A. Sloane, An upper bound for self-dual codes, Information and Control Vol. 22 (1973) pp. 188-200.","journal-title":"Information and Control"},{"key":"199815_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(90)90013-8","volume":"83","author":"H. Koch","year":"1990","unstructured":"H. Koch, On self-dual doubly even extremal codes, Discr. Math. Vol. 83 (1990) pp. 291-300.","journal-title":"Discr. Math."},{"key":"199815_CR20","unstructured":"F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland (1977)."},{"key":"199815_CR21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1017\/S0305004196001399","volume":"121","author":"M. Ozeki","year":"1997","unstructured":"M. Ozeki, On the notion of Jacobi polynomials for codes, Math. Proc. Cambridge Phil. Soc. Vol. 121 (1997) pp. 15-30.","journal-title":"Math. Proc. Cambridge Phil. Soc."},{"key":"199815_CR22","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0012-365X(72)90034-9","volume":"3","author":"V. Pless","year":"1972","unstructured":"V. Pless, A classification of self-orthogonal codes over GF(2), Discr. Math. Vol. 3 (1972) pp. 209-246.","journal-title":"Discr. Math."},{"key":"199815_CR23","unstructured":"V. Pless, Introduction to the Theory of Error Correcting Codes, second edition, Wiley (1989)."},{"key":"199815_CR24","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0097-3165(75)90042-4","volume":"18","author":"V. Pless","year":"1975","unstructured":"V. Pless, N.J.A. Sloane, On the classification and enumeration of self-dual codes, J. of Comb. Theory Ser. A Vol. 18 (1975) pp. 313-335.","journal-title":"J. of Comb. Theory Ser. A"},{"key":"199815_CR25","doi-asserted-by":"crossref","unstructured":"I. Schur, Vorlesungen ueber Invarianttheorie, Springer (1968).","DOI":"10.1007\/978-3-642-95032-2"},{"key":"199815_CR26","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1090\/S0273-0979-1979-14597-X","volume":"3","author":"R.P. Stanley","year":"1979","unstructured":"R.P. Stanley, Invariants of finite groups and their applications to combinatorics, Bull. AMS Vol. 3 (1979) pp. 475-497.","journal-title":"Bull. AMS"},{"key":"199815_CR27","doi-asserted-by":"crossref","unstructured":"B. Sturmfels, Algorithms in Invariant Theory, Springer (1993).","DOI":"10.1007\/978-3-7091-4368-1"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008327726247.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008327726247\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008327726247.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:48:50Z","timestamp":1753760930000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008327726247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["199815"],"URL":"https:\/\/doi.org\/10.1023\/a:1008327726247","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}