{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:53Z","timestamp":1754161613168,"version":"3.41.2"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"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,12]]},"DOI":"10.1023\/a:1008337219570","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"103-124","source":"Crossref","is-referenced-by-count":5,"title":["Split Weight Enumerators for the Preparata Codes with Applications to Designs"],"prefix":"10.1007","volume":"18","author":[{"given":"Iwan","family":"Duursma","sequence":"first","affiliation":[]},{"given":"Tor","family":"Helleseth","sequence":"additional","affiliation":[]},{"given":"Chunming","family":"Rong","sequence":"additional","affiliation":[]},{"given":"Kyeongcheol","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"240913_CR1","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","volume":"6","author":"E. F. Assmus","year":"1969","unstructured":"E. F. Assmus and H. F. Mattson, Jr., New 5-designs, J. Combin. Theory. Theory, Vol. 6 (1969) pp. 122-151.","journal-title":"J. Combin. Theory. Theory"},{"issue":"3","key":"240913_CR2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/jcd.3180020307","volume":"2","author":"A. Baartmans","year":"1994","unstructured":"A. Baartmans, I. Bluskov, and V. Tonchev, The Preparata codes and a class of 4-designs, J. Combin. Des., Vol. 2,No. 3 (1994) pp. 167-170.","journal-title":"J. Combin. Des."},{"issue":"3","key":"240913_CR3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01793006","volume":"11","author":"J. Bierbrauer","year":"1995","unstructured":"J. Bierbrauer, A new family of 4-designs, Graphs-Combin., Vol. 11,No. 3 (1995) pp. 209-211.","journal-title":"Graphs-Combin."},{"key":"240913_CR4","unstructured":"J. Bierbrauer and Tran van Trung, Shadow and shade of designs 4 \u2212 (2f + 1, 5, 5), manuscript."},{"key":"240913_CR5","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1109\/18.605585","volume":"43","author":"A. Bonnecaze","year":"1997","unstructured":"A. Bonnecaze and I. M. Duursma, Translates of linear codes over Z4, IEEE Trans. Inform. Theory, Vol. 43 (1997) pp. 1218-1230.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"240913_CR6","unstructured":"A. Bonnecaze, B. Mourrain, and P. Sol\u00e9, Jacobi polynomials, type II codes, and designs, Designs, Codes and Cryptography, to appear."},{"key":"240913_CR7","unstructured":"A. Bonnecaze, E. Rains, and P. Sol\u00e9, 3-colored 5-designs and Z4-codes, J. Stat. Plann. Inference, to appear."},{"key":"240913_CR8","unstructured":"I. M. Duursma, Preparata codes through lattices, IEEE Trans. Inform. Theory, to appear."},{"key":"240913_CR9","unstructured":"J. Fields and V. Pless, Split weight enumerators of extremal self-dual codes, Proceedings of the 35th Allerton Conference on Communication, Control and Computing, UIUC (1997) pp. 422-431."},{"key":"240913_CR10","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"A. R. Hammons","year":"1994","unstructured":"A. R. Hammons, P. V. Kumar, A. R. Calderbank, N. J. A. Sloane, and P. Sol\u00e9, The Z4-linearity of Kerdock, Preparata, Goethals, and related codes, IEEE Trans. Inform. Theory, Vol. 40 (1994) pp. 301-319.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"240913_CR11","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":"M. Harada, New 5-designs constructed from the lifted Golay codes over Z4, J. Combin. Designs, Vol. 6 (1998) pp. 225-229.","journal-title":"J. Combin. Designs"},{"key":"240913_CR12","doi-asserted-by":"crossref","first-page":"2040","DOI":"10.1109\/18.476333","volume":"41","author":"T. Helleseth","year":"1995","unstructured":"T. Helleseth and P. V. Kumar, The algebraic decoding of the Z4-linear Goethals code, IEEE Trans. Inform. Theory, Vol. 41 (1995) pp. 2040-2048.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"240913_CR13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1023\/A:1008363617109","volume":"15","author":"T. Helleseth","year":"1998","unstructured":"T. Helleseth, P. V. Kumar, and K. Yang, An infinite family of 3-designs from Preparata codes over Z4, Designs, Codes, and Cryptography, Vol. 15,No. 2 (1998) pp. 175-181.","journal-title":"Designs, Codes, and Cryptography"},{"key":"240913_CR14","unstructured":"T. Helleseth, C. Rong, and K. Yang. New infinite families of 3-designs from Preparata codes ove Z4, Reports in Informatics No. 137, University of Bergen (1997)."},{"key":"240913_CR15","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/18.370147","volume":"41","author":"P. V. Kumar","year":"1995","unstructured":"P. V. Kumar, T. Helleseth, and A. R. Calderbank, An upper bound for Weil exponential sums over Galois rings and its applications, IEEE Trans. Inform. Theory, Vol. 41 (1995) pp. 456-468.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"240913_CR16","series-title":"Encyclopedia of Mathemathics and Its Applications","volume-title":"Finite Fields","author":"R. Lidl","year":"1983","unstructured":"R. Lidl and H. Niederreiter, Finite Fields, Vol. 20 of Encyclopedia of Mathemathics and Its Applications, Addison-Wesley, Reading, MA (1983)."},{"key":"240913_CR17","unstructured":"F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland (1977)."},{"issue":"1","key":"240913_CR18","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 Philos. Soc, Vol. 121,No. 1 (1997) pp. 15-30.","journal-title":"Math. Proc. Cambridge Philos. Soc"},{"issue":"1","key":"240913_CR19","first-page":"38","volume":"7","author":"N. V. Semakov","year":"1971","unstructured":"N. V. Semakov, V. A. Zinoviev, and G. V. Zaitsev, Uniformly packed codes, Problems of Information Transmission, Vol. 7,No. 1 (1971) pp. 38-50.","journal-title":"Problems of Information Transmission"},{"key":"240913_CR20","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0024-3795(93)00106-A","volume":"216","author":"J. Simonis","year":"1995","unstructured":"J. Simonis, MacWilliams identities and coordinate partitions, Linear Algebra Appl., Vol. 216 (1995) pp. 81-91.","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"240913_CR21","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/(SICI)1520-6610(1996)4:3<203::AID-JCD3>3.0.CO;2-J","volume":"4","author":"V. Tonchev","year":"1996","unstructured":"V. Tonchev, A class of Steiner 4-wise balanced designs derived from Preparata codes, J. Combin. Des., Vol. 4,No. 3 (1996) pp. 203-204.","journal-title":"J. Combin. Des."},{"key":"240913_CR22","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1109\/18.641549","volume":"43","author":"K. Yang","year":"1997","unstructured":"K. Yang and T. Helleseth, On the weight hierarchy of the Preparata code over Z4, IEEE Trans. Inform. Theory, Vol. 43 (1997) pp. 1832-1844.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"240913_CR23","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1023\/A:1008319818926","volume":"15","author":"K. Yang","year":"1998","unstructured":"K. Yang and T. Helleseth, Two new infinite families of 3-designs of Kerdock codes over Z4, Designs, Codes, and Cryptography, Vol. 15,No. 2 (1998) pp. 201-214.","journal-title":"Designs, Codes, and Cryptography"},{"key":"240913_CR24","unstructured":"G. V. Zaitsev, V. A. Zinoviev, and N. V. Semakov, Interrelation of Preparata and Hamming codes and extension of Hamming codes to new double-error-correcting codes (B. N. Petroc and F. Cs\u00e1ki, eds.) 2nd International Symposium on Information Theory, Akad\u00e9miai Kiad\u00f3, Budapest (1973) pp. 257-263."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008337219570.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008337219570\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008337219570.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:31:40Z","timestamp":1753759900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008337219570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["240913"],"URL":"https:\/\/doi.org\/10.1023\/a:1008337219570","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}