{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:37Z","timestamp":1772283577157,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,12,7]],"date-time":"2015-12-07T00:00:00Z","timestamp":1449446400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004541","name":"Ministry of Human Resource Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004541","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s12095-015-0172-3","type":"journal-article","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T00:24:49Z","timestamp":1449534289000},"page":"241-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A mass formula for negacyclic codes of length 2 k and some good negacyclic codes over \u2124 4 + u \u2124 4 $\\mathbb {Z}_{4}+u\\mathbb {Z}_{4}$"],"prefix":"10.1007","volume":"9","author":[{"given":"Rama Krishna","family":"Bandi","sequence":"first","affiliation":[]},{"given":"Maheshanand","family":"Bhaintwal","sequence":"additional","affiliation":[]},{"given":"Nuh","family":"Aydin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,7]]},"reference":[{"key":"172_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(02)00432-8","volume":"128","author":"T Abualrub","year":"2003","unstructured":"Abualrub, T., Oehmke, R.: Cyclic codes of length 2 e over \u2124 4 $\\mathbb {Z}_{4}$ . Discrete Appl. Math. 128, 3\u20139 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"9","key":"172_CR2","doi-asserted-by":"crossref","first-page":"2126","DOI":"10.1109\/TIT.2003.815763","volume":"49","author":"T Abualrub","year":"2003","unstructured":"Abualrub, T., Oehmke, R.: On the generators of \u2124 4 $\\mathbb {Z}_{4}$ cyclic codes of length 2 e . IEEE Trans. Inf. Theory 49(9), 2126\u20132133 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"172_CR3","unstructured":"Database of \u2124 4 $\\mathbb {Z}_{4}$ codes. [online] Z4Codes.info (Accessed 28 January 2015)"},{"issue":"1\u20134","key":"172_CR4","first-page":"1","volume":"34","author":"N Aydin","year":"2009","unstructured":"Aydin, N., Asamov, T.: A database of \u2124 4 $\\mathbb {Z}_{4}$ codes. J. Comb. Inf. Syst. Sci. 34(1\u20134), 1\u201312 (2009)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"172_CR5","doi-asserted-by":"crossref","unstructured":"Bandi, R.K., Bhaintwal, M.: Cyclic codes over \u2124 4 + u \u2124 4 $\\mathbb {Z}_{4}+u\\mathbb {Z}_{4}$ , To appear in the proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, September 13\u201318, 2015, Bengaluru, India","DOI":"10.1109\/IWSDA.2015.7458411"},{"key":"172_CR6","doi-asserted-by":"publisher","unstructured":"Bandi, R.K., Bhaintwal, M.: Negaycyclic codes of length 2 k over \u2124 4 + u \u2124 4 $\\mathbb {Z}_{4}+u\\mathbb {Z}_{4}$ , To apper in Int. J. Comput. Math., doi: 10.1080\/00207160.2015.1112380","DOI":"10.1080\/00207160.2015.1112380"},{"key":"172_CR7","unstructured":"Berlekamp, E.R.: Negacyclic codes for the Lee metric. In: Proceedings of Conference Combinatorial Mathematics and Its Applications, pp. 298\u2013316. Chapel Hill: Univ, North Carolina Press (1968)"},{"issue":"6","key":"172_CR8","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 \u2124 4 $\\mathbb {Z}_{4}$ of even length. IEEE Trans. Inf. Theory 49(6), 1417\u20131424 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"172_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0166-218X(02)00434-1","volume":"128","author":"T Blackford","year":"2003","unstructured":"Blackford, T.: Cyclic codes over of \u2124 4 $\\mathbb {Z}_{4}$ oddly even length. Discrete Appl. Math. 128, 27\u201346 (2003)","journal-title":"Discrete Appl. Math."},{"key":"172_CR10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/18.75249","volume":"37","author":"G Castagnoli","year":"1991","unstructured":"Castagnoli, G., Massey, J.L., Schoeller, P.A., Seemann, N.V.: On repeated-root cyclic codes. IEEE Trans. Inf. Theory 37, 337\u2013342 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"172_CR11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TIT.2006.887487","volume":"53","author":"HQ Dinh","year":"2007","unstructured":"Dinh, H.Q.: Complete distances of all negacyclic codes of length 2 s over \u2124 2 a $\\mathbb {Z}_{2^{a}}$ . IEEE Trans. Inf. Theory 53(1), 147\u2013161 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"172_CR12","doi-asserted-by":"crossref","first-page":"4252","DOI":"10.1109\/TIT.2005.859284","volume":"51","author":"HQ Dinh","year":"2005","unstructured":"Dinh, H.Q.: Negacyclic codes of length 2 s over Galois rings. IEEE Trans. Inf. Theory 51(12), 4252\u20134262 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"172_CR13","doi-asserted-by":"crossref","first-page":"1728","DOI":"10.1109\/TIT.2004.831789","volume":"50","author":"HQ Dinh","year":"2004","unstructured":"Dinh, H.Q., Permouth, S.R.L.: Cyclic codes and negacyclic codes over finite chain ring. IEEE Trans. Inf. Theory 50(8), 1728\u20131744 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"172_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10623-005-2773-x","volume":"39","author":"ST Dougherty","year":"2006","unstructured":"Dougherty, S.T., Ling, S.: Cyclic codes over \u2124 4 $\\mathbb {Z}_{4}$ of even length. Des. Codes Cryptogr. 39, 127\u2013153 (2006)","journal-title":"Des. Codes Cryptogr."},{"key":"172_CR15","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/18.75250","volume":"37","author":"JHV Lint","year":"1991","unstructured":"Lint, J.H.V.: Repeated-root cyclic codes. IEEE Trans. Inf. Theory 37, 343\u2013345 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"172_CR16","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/PL00012382","volume":"10","author":"G Norton","year":"2000","unstructured":"Norton, G., Salagean, A.: On the structure of linear and cyclic codes over a finite chain ring. Appl. Algebra Eng. Comm. Comput. 10(6), 489\u2013506 (2000)","journal-title":"Appl. Algebra Eng. Comm. Comput."},{"key":"172_CR17","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1109\/18.556131","volume":"43","author":"LZ Tang","year":"1997","unstructured":"Tang, L.Z., Soh, C.B., Gunawan, E.: A note on the q-ary image of a q -ary repeated-root cyclic code. IEEE Trans. Inf. Theory 43, 732\u2013737 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"172_CR18","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 \u2124 4 $\\mathbb {Z}_{4}$ . IEEE Trans. Inf. Theory 45(7), 2527\u20132532 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"172_CR19","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.ffa.2013.12.007","volume":"27","author":"B Yildiz","year":"2014","unstructured":"Yildiz, B., Karadeniz, S.: Linear codes over \u2124 4 + u \u2124 4 $\\mathbb {Z}_{4}+u\\mathbb {Z}_{4}$ , MacWilliams identities, projections, and formally self-dual codes. Finite Fields Appl. 27, 24\u201340 (2014)","journal-title":"Finite Fields Appl."},{"issue":"4","key":"172_CR20","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1504\/IJICOT.2014.066107","volume":"2","author":"B Yildiz","year":"2014","unstructured":"Yildiz, B., Aydin, N.: On cyclic codes over \u2124 4 + u \u2124 4 $\\mathbb {Z}_{4} + u\\mathbb {Z}_{4}$ and their \u2124 4 $\\mathbb {Z}_{4}$ -images. Int. J. Inf. Coding Theory 2(4), 226\u2013237 (2014)","journal-title":"Int. J. Inf. Coding Theory"},{"issue":"2","key":"172_CR21","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1109\/18.485736","volume":"42","author":"KH Zimmermann","year":"1996","unstructured":"Zimmermann, K.H: On generalizations of repeated-root cyclic codes. IEEE Trans. Inf. Theory 42(2), 641\u2013649 (1996)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-015-0172-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-015-0172-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-015-0172-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-015-0172-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T03:08:42Z","timestamp":1567393722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-015-0172-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,7]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["172"],"URL":"https:\/\/doi.org\/10.1007\/s12095-015-0172-3","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,7]]}}}