{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T23:15:47Z","timestamp":1674861347850},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T00:00:00Z","timestamp":1302220800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s10623-011-9500-6","type":"journal-article","created":{"date-parts":[[2011,4,7]],"date-time":"2011-04-07T14:35:12Z","timestamp":1302186912000},"page":"161-174","source":"Crossref","is-referenced-by-count":8,"title":["Negacyclic self-dual codes over finite chain rings"],"prefix":"10.1007","volume":"62","author":[{"given":"Xiaoshan","family":"Kai","sequence":"first","affiliation":[]},{"given":"Shixin","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,8]]},"reference":[{"key":"9500_CR1","unstructured":"Berlekamp E.R.: Negacyclic codes for the Lee metric. In: Proc. Conf. Combinatorial Mathematics and Its Applications, Chapel Hill, NC, pp. 298\u2013316 (1968)."},{"key":"9500_CR2","unstructured":"Berlekamp E.R.: Algebraic Coding Theory. Revised edition, Aegean Park, Laguna Hills (1984)."},{"key":"9500_CR3","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1109\/TIT.2003.811915","volume":"49","author":"T. Blackford","year":"2003","unstructured":"Blackford T.: Negacyclic codes over $${\\mathbb{Z}_4}$$ of even length. IEEE Trans. Inform. Theory 49, 1417\u20131424 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9500_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01390768","volume":"6","author":"A.R. Calderbank","year":"1995","unstructured":"Calderbank A.R., Sloane N.J.A.: Modular and p-adic cyclic codes. Des. Codes Cryptogr. 6, 21\u201335 (1995)","journal-title":"Des. Codes Cryptogr."},{"key":"9500_CR5","doi-asserted-by":"crossref","first-page":"4252","DOI":"10.1109\/TIT.2005.859284","volume":"51","author":"H.Q. Dinh","year":"2005","unstructured":"Dinh H.Q.: Negacyclic codes of length 2 s over Galois rings. IEEE Trans. Inform. Theory 51, 4252\u20134262 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9500_CR6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TIT.2006.887487","volume":"53","author":"H.Q. Dinh","year":"2007","unstructured":"Dinh H.Q.: Complete distances of all negacyclic codes of length 2 s over $${\\mathbb{Z}_{2^{a}}}$$ . IEEE Trans. Inform. Theory 53, 147\u2013161 (2007)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9500_CR7","doi-asserted-by":"crossref","first-page":"1728","DOI":"10.1109\/TIT.2004.831789","volume":"50","author":"H.Q. Dinh","year":"2004","unstructured":"Dinh H.Q., L\u00f3pez-Permouth S.R.: Cyclic and negacyclic codes over finite chain rings. IEEE Trans. Inform. Theory 50, 1728\u20131744 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9500_CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10623-005-2773-x","volume":"39","author":"S.T. Dougherty","year":"2006","unstructured":"Dougherty S.T., Ling S.: Cyclic codes over $${\\mathbb{Z}_4}$$ of even length. Des. Codes Cryptogr. 39, 127\u2013153 (2006)","journal-title":"Des. Codes Cryptogr."},{"key":"9500_CR9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1109\/18.817524","volume":"46","author":"S.T. Dougherty","year":"2000","unstructured":"Dougherty S.T., Shiromoto K.: MDR codes over $${\\mathbb{Z}_k}$$ . IEEE Trans. Inform. Theory 46, 265\u2013269 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9500_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10623-008-9215-5","volume":"50","author":"S.T. Dougherty","year":"2009","unstructured":"Dougherty S.T., Kim J.L., Kulosman H.: MDS codes over finite principal ideal rings. Des. Codes Cryptogr. 50, 77\u201392 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"9500_CR11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1504\/IJICOT.2010.032133","volume":"1","author":"S.T. Dougherty","year":"2010","unstructured":"Dougherty S.T., Kim J.L., Liu H.: Constructions of self-dual codes over finite commutative chain rings. Int. J. Inform. Coding Theory 1, 171\u2013190 (2010)","journal-title":"Int. J. Inform. Coding Theory"},{"key":"9500_CR12","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"A.R. Hammons Jr.","year":"1994","unstructured":"Hammons A.R. Jr., Kumar P.V., Calderbank A.R., Sloane N.J.A., Sol\u00e9 P.: The $${\\mathbb{Z}_{4}}$$ -linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inform. Theory 40, 301\u2013319 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9500_CR13","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1006\/ffta.1997.0189","volume":"3","author":"P. Kanwar","year":"1997","unstructured":"Kanwar P., L\u00f3pez-Permouth S.R.: Cyclic codes over the integers modulo p m . Finite Fields Appl. 3, 334\u2013352 (1997)","journal-title":"Finite Fields Appl."},{"key":"9500_CR14","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1109\/18.53751","volume":"36","author":"A. Krishna","year":"1990","unstructured":"Krishna A., Sarwate D.V.: Pseudocyclic maximum distance separable codes. IEEE Trans. Inform. Theory 36, 880\u2013884 (1990)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9500_CR15","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloan N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977)"},{"key":"9500_CR16","volume-title":"Finite Rings with Identity","author":"B.R. McDonald","year":"1974","unstructured":"McDonald B.R.: Finite Rings with Identity. Dekker, New York (1974)"},{"key":"9500_CR17","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/PL00012382","volume":"10","author":"G.H. Norton","year":"2000","unstructured":"Norton G.H., S\u01cel\u01cegean A.: On the structure of linear and cyclic codes over a finite chain ring. Appl. Algebra Eng. Com. Comp. 10, 489\u2013506 (2000)","journal-title":"Appl. Algebra Eng. Com. Comp."},{"key":"9500_CR18","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1109\/18.841186","volume":"46","author":"G.H. Norton","year":"2000","unstructured":"Norton G.H., S\u01cel\u01cegean A.: On the Hamming distance of linear codes over a finite chain ring. IEEE Trans. Inform. Theory 46, 1060\u20131067 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9500_CR19","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.dam.2005.03.016","volume":"154","author":"A. S\u01cel\u01cegean","year":"2006","unstructured":"S\u01cel\u01cegean A.: Repeated-root cyclic and negacyclic codes over finite chain rings. Discrete Appl. Math. 154, 413\u2013419 (2006)","journal-title":"Discrete Appl. Math."},{"key":"9500_CR20","first-page":"291","volume":"6","author":"Z. Wan","year":"1999","unstructured":"Wan Z.: Cyclic codes over Galois rings. Algebra Colloq. 6, 291\u2013304 (1999)","journal-title":"Algebra Colloq."},{"key":"9500_CR21","doi-asserted-by":"crossref","first-page":"2527","DOI":"10.1109\/18.796397","volume":"45","author":"J. Wolfmann","year":"1999","unstructured":"Wolfmann J.: Negacyclic and cyclic codes over $${\\mathbb{Z}_4}$$ . IEEE Trans. Inform. Theory 45, 2527\u20132532 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9500_CR22","doi-asserted-by":"crossref","first-page":"2382","DOI":"10.1016\/j.disc.2008.05.013","volume":"309","author":"S. Zhu","year":"2009","unstructured":"Zhu S., Kai X.: Dual and self-dual negacyclic codes of even length over $${\\mathbb{Z}_{2^{a}}}$$ . Dis. Math. 309, 2382\u20132391 (2009)","journal-title":"Dis. Math."},{"key":"9500_CR23","unstructured":"Zhu S., Kai X., Li P.: Negacyclic MDS codes over GR(2 a , m). ISIT 2009, Seoul, Korea, June 28\u2013July 3 (2009)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9500-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9500-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9500-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:30Z","timestamp":1559246310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9500-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,8]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9500"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9500-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,8]]}}}