{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:26:29Z","timestamp":1761060389127,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,7,18]],"date-time":"2017-07-18T00:00:00Z","timestamp":1500336000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672036"],"award-info":[{"award-number":["61672036"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Open Research Fund of National Mobile Communications Research Laboratory, Southeast University","award":["2015D11"],"award-info":[{"award-number":["2015D11"]}]},{"name":"Technology Foundation for Selected Overseas Chinese Scholar, Ministry of Personnel of China","award":["05015133"],"award-info":[{"award-number":["05015133"]}]},{"name":"Key projects of support program for outstanding young talents in Colleges and Universities","award":["gxyqZD2016008"],"award-info":[{"award-number":["gxyqZD2016008"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10623-017-0390-0","type":"journal-article","created":{"date-parts":[[2017,7,18]],"date-time":"2017-07-18T04:21:38Z","timestamp":1500351698000},"page":"1201-1209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["On two-weight \n                $$\\mathbb {Z}_{2^k}$$\n                \n                    \n                        \n                            Z\n                            \n                                2\n                                k\n                            \n                        \n                    \n                \n            -codes"],"prefix":"10.1007","volume":"86","author":[{"given":"Minjia","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zahra","family":"Sepasdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adel","family":"Alahmadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Sol\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,18]]},"reference":[{"key":"390_CR1","volume-title":"Spectra of Graphs","author":"AE Brouwer","year":"2011","unstructured":"Brouwer A.E., Haemers W.H.: Spectra of Graphs. Springer, New York (2011)."},{"key":"390_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10623-007-9136-8","volume":"48","author":"E Byrne","year":"2008","unstructured":"Byrne E., Greferath M., Honold T.: Ring geometries, two-weight codes and strongly regular graphs. Des. Codes Cryptogr. 48, 1\u201316 (2008).","journal-title":"Des. Codes Cryptogr."},{"key":"390_CR3","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/j.ffa.2012.01.002","volume":"18","author":"E Byrne","year":"2012","unstructured":"Byrne E., Kiermaier M., Sneyd A.: Properties of codes with two homogeneous weights. Finite Fields Appl. 18, 711\u2013727 (2012).","journal-title":"Finite Fields Appl."},{"key":"390_CR4","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1112\/jlms\/s2-26.2.365","volume":"26","author":"R Calderbank","year":"1982","unstructured":"Calderbank R.: On uniformly packed \n                        $$[n,n-k,4]$$\n                        \n                            \n                                \n                                    [\n                                    n\n                                    ,\n                                    n\n                                    -\n                                    k\n                                    ,\n                                    4\n                                    ]\n                                \n                            \n                        \n                     codes over \n                        $$GF(q)$$\n                        \n                            \n                                \n                                    G\n                                    F\n                                    (\n                                    q\n                                    )\n                                \n                            \n                        \n                     and a class of caps in \n                        $$PG(k-1,q)$$\n                        \n                            \n                                \n                                    P\n                                    G\n                                    (\n                                    k\n                                    -\n                                    1\n                                    ,\n                                    q\n                                    )\n                                \n                            \n                        \n                    . J. Lond. Math. Soc. (2) 26, 365\u2013384 (1982).","journal-title":"J. Lond. Math. Soc. (2)"},{"key":"390_CR5","doi-asserted-by":"crossref","first-page":"1543","DOI":"10.1109\/18.681328","volume":"44","author":"C Carlet","year":"1998","unstructured":"Carlet C.: \n                        $${\\mathbb{Z}}_{2^k}$$\n                        \n                            \n                                \n                                    Z\n                                    \n                                        2\n                                        k\n                                    \n                                \n                            \n                        \n                    -linear codes. IEEE Trans. Inf. Theory 44, 1543\u20131547 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"390_CR6","first-page":"208","volume":"33","author":"I Constantinescu","year":"1997","unstructured":"Constantinescu I., Heise W.: A metric for codes over residue class rings of integers. Probl. Inf. Transm. 33, 208\u2013213 (1997).","journal-title":"Probl. Inf. Transm."},{"key":"390_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(72)90024-6","volume":"3","author":"P Delsarte","year":"1972","unstructured":"Delsarte P.: Weights of linear codes and strongly regular normed spaces. Discret. Math. 3, 47\u201364 (1972).","journal-title":"Discret. Math."},{"key":"390_CR8","unstructured":"Delsarte P.: An algebraic approach to the association schemes of Coding Theory. Philips Research Reports Supplement No. 10 (1973)"},{"key":"390_CR9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"R Hammons","year":"1994","unstructured":"Hammons R., Kumar V.P., Calderbank A.R., Sloane N.J.A., Sol\u00e9 P.: The \n                        $${\\mathbb{Z}}_4-$$\n                        \n                            \n                                \n                                    \n                                        Z\n                                        4\n                                    \n                                    -\n                                \n                            \n                        \n                    linearity of Kerdock, Preparata, Goethals and related codes. IEEE Trans. Inf. Theory 40, 301\u2013319 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"390_CR10","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/PL00000451","volume":"76","author":"T Honold","year":"2001","unstructured":"Honold T.: A characterization of finite Frobenius rings. Arch. Math. 76, 406\u2013415 (2001).","journal-title":"Arch. Math."},{"key":"390_CR11","unstructured":"Honold T.: Two-intersection sets in projective Hjemslev spaces. In: Edelmayer A. (ed.) Proceedings of MTNS 2010, Budapest, pp. 1807\u20131813 (2010)"},{"key":"390_CR12","doi-asserted-by":"crossref","unstructured":"Krotov D.: \n                        $${\\mathbb{Z}}_4-$$\n                        \n                            \n                                \n                                    \n                                        Z\n                                        4\n                                    \n                                    -\n                                \n                            \n                        \n                    linear Hadamard and extended perfect codes. In: Proceedings of the International Workshop on Coding and Cryptography WCC 2001, Paris, January 2001, pp. 329\u2013334. Electronic Notes in Discrete Mathematics, vol. 6, pp. 107\u2013112 (2001)","DOI":"10.1016\/S1571-0653(04)00161-1"},{"key":"390_CR13","doi-asserted-by":"crossref","first-page":"1532","DOI":"10.1109\/TIT.2007.892787","volume":"53","author":"D Krotov","year":"2007","unstructured":"Krotov D.: On \n                        $${\\mathbb{Z}}_{2^k}-$$\n                        \n                            \n                                \n                                    \n                                        Z\n                                        \n                                            2\n                                            k\n                                        \n                                    \n                                    -\n                                \n                            \n                        \n                    dual binary codes. IEEE Trans. Inf. Theory 53, 1532\u20131537 (2007).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"390_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511755279","volume-title":"Coding Theory: A First Course","author":"S Ling","year":"2004","unstructured":"Ling S., Xing C.P.: Coding Theory: A First Course. Cambridge University Press, New York (2004)."},{"key":"390_CR15","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1109\/TIT.2005.860464","volume":"52","author":"KT Phelps","year":"2006","unstructured":"Phelps K.T., Rif\u00e0 J., Villanueva M.: On the additive \n                        $$({\\mathbb{Z}}_4-$$\n                        \n                            \n                                \n                                    (\n                                    \n                                        Z\n                                        4\n                                    \n                                    -\n                                \n                            \n                        \n                    linear and non-\n                        $${\\mathbb{Z}}_4-$$\n                        \n                            \n                                \n                                    \n                                        Z\n                                        4\n                                    \n                                    -\n                                \n                            \n                        \n                    linear ) Hadamard codes. Rank and Kernel. IEEE Trans. Inf. Theory 52, 316\u2013319 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"390_CR16","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s11424-014-2188-8","volume":"27","author":"MJ Shi","year":"2014","unstructured":"Shi M.J., Wang Y.: Optimal binary codes from one-Lee weight codes and two-Lee weight projective codes over \n                        $${\\mathbb{Z}}_4,$$\n                        \n                            \n                                \n                                    \n                                        Z\n                                        4\n                                    \n                                    ,\n                                \n                            \n                        \n                    . J. Syst. Sci. Complex. 27, 795\u2013810 (2014).","journal-title":"J. Syst. Sci. Complex."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-017-0390-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0390-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0390-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,19]],"date-time":"2018-04-19T11:55:55Z","timestamp":1524138955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-017-0390-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,18]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["390"],"URL":"https:\/\/doi.org\/10.1007\/s10623-017-0390-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2017,7,18]]}}}