{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:29Z","timestamp":1754161589364,"version":"3.41.2"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"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":[[1998,11]]},"DOI":"10.1023\/a:1008319818926","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"201-214","source":"Crossref","is-referenced-by-count":4,"title":["Two New Infinite Families of 3-Designs from Kerdock Codes over Z4"],"prefix":"10.1007","volume":"15","author":[{"given":"Kyeongcheol","family":"Yang","sequence":"first","affiliation":[]},{"given":"Tor","family":"Helleseth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"181767_CR1","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","volume":"6","author":"E. F. Assmus Jr","year":"1969","unstructured":"E. F. Assmus, Jr. and H. F. Mattson, Jr., New 5-designs, J. Combin. Theory. Theory, Vol. 6 (1969) pp. 122-151.","journal-title":"J. Combin. Theory. Theory"},{"key":"181767_CR2","doi-asserted-by":"crossref","unstructured":"C. J. Colbourn and J. H. Dinitz (Eds.), The CRC Handbook of Combinatorial Designs, CRC Press, pp. 47-66 (1996).","DOI":"10.1201\/9781420049954"},{"key":"181767_CR3","doi-asserted-by":"publisher","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. Sole, The Z\n4-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":"181767_CR4","doi-asserted-by":"crossref","unstructured":"M. Harada, New 5-designs constructed from the lifted Golay code over Z\n4, preprint, presented at the Recent Results Session of 1997 IEEE International Symposium on Information Theory, Ulm, Germany, June 29-July 4, 1997.","DOI":"10.1002\/(SICI)1520-6610(1998)6:3<225::AID-JCD4>3.0.CO;2-H"},{"key":"181767_CR5","doi-asserted-by":"publisher","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 Z\n4-linear Goethals code, IEEE Trans. Inform. Theory, Vol. 41 (1995) pp. 2040-2048.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"181767_CR6","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 Z\n4, Designs, Codes and Cryptography, vol. 15 (1998) pp. 175-181.","journal-title":"Designs, Codes and Cryptography"},{"key":"181767_CR7","doi-asserted-by":"publisher","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":"181767_CR8","volume-title":"Finite Fields, Vol. 20 of Encyclopedia of Mathematics and Its Applications","author":"R. Lidl","year":"1983","unstructured":"R. Lidl and H. Niederreiter, Finite Fields, Vol. 20 of Encyclopedia of Mathematics and Its Applications, Addison-Wesley, Reading, MA (1983)."},{"key":"181767_CR9","unstructured":"F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland (1977)."},{"key":"181767_CR10","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1109\/18.532905","volume":"42","author":"K. Yang","year":"1996","unstructured":"K. Yang, T. Helleseth, P. V. Kumar, and A. Shanbhag, On the weight hierarchy of Kerdock codes, IEEE Trans. Inform. Theory, Vol. 42 (1996) pp. 1587-1593.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008319818926.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008319818926\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008319818926.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:56:36Z","timestamp":1753761396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008319818926"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["181767"],"URL":"https:\/\/doi.org\/10.1023\/a:1008319818926","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}