{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:34:13Z","timestamp":1648697653591},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2015,3,11]],"date-time":"2015-03-11T00:00:00Z","timestamp":1426032000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10623-015-0053-y","type":"journal-article","created":{"date-parts":[[2015,3,10]],"date-time":"2015-03-10T09:20:50Z","timestamp":1425979250000},"page":"357-363","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enumeration of Kerdock codes of length 64"],"prefix":"10.1007","volume":"77","author":[{"given":"Kevin","family":"Phelps","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,11]]},"reference":[{"key":"53_CR1","doi-asserted-by":"crossref","unstructured":"Borges J., Fernandez C., Phelps K.T.: QRM codes. IEEE Trans. Inf. Theory 54(1), 380\u2013386 (2008).","DOI":"10.1109\/TIT.2007.911211"},{"key":"53_CR2","doi-asserted-by":"crossref","unstructured":"Borges J., Phelps K.T., Rifa J., Zinoviev V.: On $${\\mathbb{Z}}_4$$ Z 4 -linear Preparata-like and Kerdock-like codes. IEEE Trans. Inf. Theory 49(11), 2834\u20132843 (2003).","DOI":"10.1109\/TIT.2003.819329"},{"key":"53_CR3","doi-asserted-by":"crossref","unstructured":"Calderbank A.R., Cameron P.J., Kantor W.M., Seidel J.J.: $${\\mathbb{Z}}_4$$ Z 4 -Kerdock codes, orthogonal spreads, and extremal Euclidean line-sets. Proc. Lond. Math. Soc. (3) 75(2), 436\u2013480 (1997).","DOI":"10.1112\/S0024611597000403"},{"key":"53_CR4","doi-asserted-by":"crossref","unstructured":"Carlet C., Yucas J.: Piecewise constructions of bent and almost optimal Boolean functions. Des. Codes Cryptogr. 37, 449\u2013464 (2005).","DOI":"10.1007\/s10623-005-4036-2"},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"Hammons A.R., Kumar P.V., Calderbank A.R., Sloane N.J.A., Sole P.: The $${\\mathbb{Z}}_{4}$$ Z 4 -linearity of Kerdock, Preparata, Goethals and related codes. IEEE Trans. Inf. Theory 40, 301\u2013319 (1994).","DOI":"10.1109\/18.312154"},{"key":"53_CR6","doi-asserted-by":"crossref","unstructured":"Kantor W.M.: An exponential number of generalized Kerdock codes. Inf. Control 53, 74\u201380 (1982).","DOI":"10.1016\/S0019-9958(82)91139-1"},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Kantor W. M.: Codes, quadratic forms and finite geometries. Different Aspects of Coding Theory (San Francisco, CA, 1995). In: Proceedings of the Symposia in Applied Mathematics, vol. 50, pp. 153\u2013177. American Mathematical Society, Providence (1995).","DOI":"10.1090\/psapm\/050\/1368640"},{"key":"53_CR8","doi-asserted-by":"crossref","unstructured":"Kantor W.M., Williams M.E.: Symplectic semi-field planes and $${\\mathbb{Z}}_4$$ Z 4 -linear codes. Trans. Am. Math. Soc. 356(3), 895\u2013938 (2003).","DOI":"10.1090\/S0002-9947-03-03401-9"},{"key":"53_CR9","doi-asserted-by":"crossref","unstructured":"Kerdock A.M.: A class of low rate nonlinear binary codes. Inf. Control 20, 182\u2013187 (1972).","DOI":"10.1016\/S0019-9958(72)90376-2"},{"key":"53_CR10","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1997)."},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"Preparata F.P.: A class of optimum nonlinear double-error correcting codes. Inf. Control 13, 378\u2013400 (1968).","DOI":"10.1016\/S0019-9958(68)90874-7"},{"key":"53_CR12","doi-asserted-by":"crossref","unstructured":"Rothaus O.S.: On bent functions. J. Comb. Theory Ser. A 20(3), 300\u2013305 (1976).","DOI":"10.1016\/0097-3165(76)90024-8"},{"key":"53_CR13","unstructured":"Semakov N.V., Zinoviev V.A., Zaitsev G.V.: On duality of Preparata and Kerdock codes. In: Proceedings of the Fifth All-Union Conference on Coding Theory, Part 2, Moscow-Gorkyi, Moscow, pp. 55\u201358 (1972)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0053-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0053-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0053-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:39Z","timestamp":1559231919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0053-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,11]]},"references-count":13,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["53"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0053-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,11]]}}}