{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T03:56:30Z","timestamp":1768794990568,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,9,17]],"date-time":"2014-09-17T00:00:00Z","timestamp":1410912000000},"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":["Cryptogr. Commun."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s12095-014-0106-5","type":"journal-article","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T09:10:23Z","timestamp":1410858623000},"page":"229-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Repeated-root constacyclic codes of length \u2113 t p s and their dual codes"],"prefix":"10.1007","volume":"7","author":[{"given":"Anuradha","family":"Sharma","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,17]]},"reference":[{"key":"106_CR1","doi-asserted-by":"crossref","unstructured":"Apostal, T.M.: Introduction to Analytic Number Theory. Springer (1976)","DOI":"10.1007\/978-3-662-28579-4"},{"issue":"2","key":"106_CR2","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.ffa.2011.09.005","volume":"18","author":"GK Bakshi","year":"2012","unstructured":"Bakshi, G.K., Raka, M.: A class of constacyclic codes over a finite field. Finite Fields Appl. 18(2), 362\u2013377 (2012)","journal-title":"Finite Fields Appl."},{"issue":"1","key":"106_CR3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ffa.2012.10.003","volume":"19","author":"GK Bakshi","year":"2013","unstructured":"Bakshi, G.K., Raka, M.: Self-dual and self-orthogonal negacyclic codes of length 2p n o v e r a f i n i t e f i e l d . Finite Fields Appl. 19(1), 39\u201354 (2013)","journal-title":"Finite Fields Appl."},{"key":"106_CR4","volume-title":"Algebraic Coding Theory","author":"ER Berlekamp","year":"1968","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory. McGraw -Hill Book Company, New York (1968)"},{"issue":"4","key":"106_CR5","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1016\/j.ffa.2008.05.004","volume":"14","author":"T Blackford","year":"2008","unstructured":"Blackford, T.: Negacyclic duadic codes. Finite Fields Appl. 14(4), 930\u2013943 (2008)","journal-title":"Finite Fields Appl."},{"issue":"6","key":"106_CR6","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1016\/j.ffa.2012.10.001","volume":"18","author":"B Chen","year":"2012","unstructured":"Chen, B., Fan, Y., Lin, L., Liu, H.: Constacyclic codes over finite fields. Finite Fields Appl. 18(6), 1217\u20131231 (2012)","journal-title":"Finite Fields Appl."},{"issue":"5","key":"106_CR7","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1016\/j.jalgebra.2010.05.027","volume":"324","author":"HQ Dinh","year":"2010","unstructured":"Dinh, H.Q.: Constacyclic codes of length p s over F p m + u F p m $p^{s \\text {over} \\mathbb {F}_{p^{m}} + u\\mathbb {F}_{p^{m}}}$ . J. Algebra 324(5), 940\u2013950 (2010)","journal-title":"J. Algebra"},{"issue":"1","key":"106_CR8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.ffa.2011.07.003","volume":"18","author":"HQ Dinh","year":"2012","unstructured":"Dinh, H.Q.: Repeated-root constacyclic codes of length 2p s . Finite Fields Appl. 18(1), 133\u2013143 (2012)","journal-title":"Finite Fields Appl."},{"issue":"9","key":"106_CR9","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/j.disc.2013.01.024","volume":"313","author":"HQ Dinh","year":"2013","unstructured":"Dinh, H.Q.: Structure of repeated-root constacyclic codes of length 3p s a n d t h e i r d u a l s . Discret. Math. 313(9), 983\u2013991 (2013)","journal-title":"Discret. Math."},{"key":"106_CR10","doi-asserted-by":"crossref","unstructured":"Dinh, H.Q.: On repeated-root constacyclic codes of length 4p s . Asian-Eur. J. Math. 6(2013). doi: 10.1142\/S1793557113500204","DOI":"10.1142\/S1793557113500204"},{"key":"106_CR11","doi-asserted-by":"crossref","unstructured":"Dinh, H.Q., Lapez-Permouth, S.R., Szabo, S.: On the structure of cyclic and negacyclic codes over nite Chain rings Codes over Rings, e-Proc. of the CIMPA Summer School, pp 18\u201329, Turkey (2008)","DOI":"10.1142\/9789812837691_0002"},{"key":"106_CR12","doi-asserted-by":"crossref","unstructured":"Guenda, K., Gulliver, T.A.: Self-dual repeated-root cyclic and negacyclic codes over finite fields. Proc. IEEE Int. Symp. Inform. Theory, 2904\u20132908 (2012)","DOI":"10.1109\/ISIT.2012.6284057"},{"issue":"4","key":"106_CR13","doi-asserted-by":"crossref","first-page":"2243","DOI":"10.1109\/TIT.2010.2092415","volume":"57","author":"Y Jia","year":"2011","unstructured":"Jia, Y., Ling, S., Xing, C.: On self-dual cyclic codes over finite fields. IEEE Trans. Inform. Theory 57(4), 2243\u20132251 (2011)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"106_CR14","volume-title":"Introduction to finite fields and their applications","author":"R Lidl","year":"2008","unstructured":"Lidl, R., Niederreiter, H.: Introduction to finite fields and their applications. Cambridge University Press, Cambridge (2008)"},{"key":"106_CR15","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.: Coding theory - A first course. Cambridge University Press, Cambridge (2004)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-014-0106-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-014-0106-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-014-0106-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T01:25:39Z","timestamp":1565832339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-014-0106-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,17]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["106"],"URL":"https:\/\/doi.org\/10.1007\/s12095-014-0106-5","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,17]]}}}